Results 81 to 90 of about 1,442,532 (348)
Planar 3-SAT with a Clause/Variable Cycle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In the Planar 3-SAT problem, we are given a 3-SAT formula together with its incidence graph, which is planar, and are asked whether this formula is satisfiable.
Alexander Pilz
doaj +1 more source
Quickly Excluding a Planar Graph
J. Comb. Theory B, 1994 In an earlier paper, the first two authors proved that for any planar graph H , every graph with no minor isomorphic to H has bounded tree width; but the bound given there was enormous. Here we prove a much better bound.
N. Robertson, P. Seymour, R. Thomas
semanticscholar +1 more source
Cubic Augmentation of Planar Graphs
, 2012 In this paper we study the problem of augmenting a planar graph such that it becomes 3-regular and remains planar. We show that it is NP-hard to decide whether such an augmentation exists. On the other hand, we give an efficient algorithm for the variant
C.D. Tóth +8 more
core +1 more source
Advanced Engineering Materials, EarlyView.In this study, exciting new bi‐/multi‐linear elastic behavior of soft elastic composites that accompany the activation of wrinkling in the embedded interfacial layers is analyzed. The new features and performance of these composite materials, including dramatic enhancements in energy storage, can be tailored by the concentration of interfacial layers ...
Narges Kaynia +2 more
wiley +1 more source
On (p, 1)-Total Labelling of Some 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ (G) ≥
Niu Bei, Zhang Xin
doaj +1 more source
On the reconstruction of planar graphs
Journal of Combinatorial Theory, Series B, 2007 AbstractWe show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs.
Mark Bilinski +2 more
openaire +2 more sources
Advanced Engineering Materials, Volume 27, Issue 6, March 2025.ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur +5 more
wiley +1 more source
Inserting a vertex into a planar graph
ACM-SIAM Symposium on Discrete Algorithms, 2009 We consider the problem of computing a crossing minimum drawing of a given planar graph G = (V, E) augmented by a star, i.e., an additional vertex v together with its incident edges Ev = {(v, u) | u ∈ V}, in which all crossings involve Ev. Alternatively,
Markus Chimani +3 more
semanticscholar +1 more source
Near-colorings: non-colorable graphs and NP-completeness [PDF]
, 2013 A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core
Mixed Linear Layouts of Planar Graphs
, 2017 A $k$-stack (respectively, $k$-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured
C Bachmaier +12 more
core +1 more source