On uniquely colorable planar graphs
From MaRDI portal
Publication:5565635
DOI10.1016/S0021-9800(69)80087-6zbMATH Open0175.50206OpenAlexW2062384828MaRDI QIDQ5565635FDOQ5565635
Gary Chartrand, Dennis P. Geller
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80087-6
Cited In (31)
- A construction of uniquely colourable graphs with equal colour class sizes
- The size of edge-critical uniquely 3-colorable planar graphs
- Uniqueness of colorings
- Uniquely colorable graphs up to automorphisms
- Size of edge-critical uniquely 3-colorable planar graphs
- Defining sets and uniqueness in graph colorings: A survey
- On uniquely 3-colorable planar graphs
- Some topics in cochromatic theory
- Complexity of fall coloring for restricted graph classes
- On two generalizations of the Alon-Tarsi polynomial method
- Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs
- r-tuple colorings of uniquely colorable graphs
- On path-chromatically unique graphs
- Graph theory
- On dispersable book embeddings
- The color space of a graph
- On uniquely partitionable planar graphs
- Disjoint independent dominating sets in graphs
- Uniquely colorable graphs
- Uniquely k-arborable graphs
- Coloring certain proximity graphs
- Five-coloring planar maps
- Two conjectures on uniquely totally colorable graphs
- Walkwise and admissible mappings between digraphs
- Uniquely total colorable graphs
- On graphs uniquely colorable under the action of their automorphism groups
- Some classes of uniquely 3-colorable graphs
- Applications of product colouring
- Title not available (Why is that?)
- On critical uniquely colorable graphs
- A note on uniquely 3-colourable planar graphs
This page was built for publication: On uniquely colorable planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565635)