Results 61 to 70 of about 149 (128)
REPRESENTATIONS OF GRAPHS ON A CYLINDER*
, 2008 . A complete characterization ofthe class ofgraphs that admit a cylindric visibility representation is presented, where vertices are representedby intervals parallel to the axis ofthe cylinderand the edgescorrespond to pairs ofvisible intervals. Moreover,
Ioannis
core
On the Hamiltonian Number of a Plane Graph
Discussiones Mathematicae Graph Theory, 2019 The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a plane graph, formulated in terms of the ...
Lewis Thomas M.
doaj +1 more source
Facial Rainbow Coloring of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +1 more source
Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]
Heliyon, 2023 Koam ANA +4 more
europepmc +1 more source
On Eggleton and Guy conjectured upper bound for the crossing number of the n-cube
, 1997 . The crossing number (G) of a graph G is the smallest integer such that there is a drawing for G with (G) crossings of edges. Let Q n denote the n--dimensional cube. Eggleton and Guy conjectured in 1970 that (Q n ) 4 n 5 32 \Gamma 2 n\Gamma2 b n
Celina Miraglia +3 more
core
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
, 1996 This paper develops new techniques for constructing separators for graphs embedded on surfaces of bounded genus. For any arbitrarily small positive " we show that any n-vertex graph G of genus g can be divided in O(n + g) time into components whose ...
L. Aleksandrov, H. Djidjev
core
On polyhedral graphs and their complements. [PDF]
Aequ Math, 2022 Maffucci RW.
europepmc +1 more source
Financial fallout from the COVID-19 pandemic:Report from a high-volume academic neurosurgery. [PDF]
Neurochirurgie, 2022 Loganadane G +13 more
europepmc +1 more source
List Edge Colourings of Some 1-Factorable Multigraphs
, 1996 The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and any set system fSe : e 2 E(G)g with each jSe j = k, we can choose elements se 2 Se such that se 6= sf whenever e and f are adjacent edges.
Luis Goddyn, M. N. Ellingham
core
An Introduction on Graph Associahedra
, 2013 By using the algorithm given by Devados [1], we have been worked on the constructionof a graph associahedra, which is a special type of convex polytope. Wehave showed that there is an isomorphism between the set of planar trees withn+1 leaves and the set
Gürbüzer, Sabri Kaan, Akyar, Bedia
core