Planar Graphs
Hassler Whitney (1933)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “A combinatorial condition for planar graphs”
Planar Graphs
The arc-width of a graph.
Barát, János, Hajnal, Péter (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some remarks on Menger's theorem
Bohdan Zelinka (1971)
Časopis pro pěstování matematiky
Similarity:
The restricted arc-width of a graph.
Arthur, David (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Even circuits of prescribed clockwise parity.
Fischer, Ilse, Little, C.H.C. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fixed-location circular arc drawing of planar graphs.
Efrat, Alon, Erten, Cesim, Kobourov, Stephen (2007)
Journal of Graph Algorithms and Applications
Similarity:
On arc-coloring of subcubic graphs.
Pinlou, Alexandre (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the crossing numbers of and
Stanislav Jendroľ, Mária Ščerbová (1982)
Časopis pro pěstování matematiky
Similarity:
A simple linear algorithm for the connected domination problem in circular-arc graphs
Ruo-Wei Hung, Maw-Shang Chang (2004)
Discussiones Mathematicae Graph Theory
Similarity:
A connected dominating set of a graph G = (V,E) is a subset of vertices CD ⊆ V such that every vertex not in CD is adjacent to at least one vertex in CD, and the subgraph induced by CD is connected. We show that, given an arc family F with endpoints sorted, a minimum-cardinality connected dominating set of the circular-arc graph constructed from F can be computed in O(|F|) time.