Uniquely colorable graphs
From MaRDI portal
Publication:5565634
DOI10.1016/S0021-9800(69)80086-4zbMATH Open0175.50205OpenAlexW1987231262MaRDI QIDQ5565634FDOQ5565634
Stephen T. Hedetniemi, Frank Harary, R. W. Robinson
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)80086-4
Cited In (38)
- Constructing uniquely realizable graphs
- A construction of uniquely colourable graphs with equal colour class sizes
- On infinite graphs with a specified number of colorings
- The size of edge-critical uniquely 3-colorable planar graphs
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
- Graphs with coloring redundant edges
- Uniqueness of colorings
- Uniquely colorable graphs up to automorphisms
- Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)
- Applications of Hajós‐Type Constructions to the Hedetniemi Conjecture
- Size of edge-critical uniquely 3-colorable planar graphs
- Defining sets and uniqueness in graph colorings: A survey
- On uniquely 3-colorable graphs
- A relation between choosability and uniquely list colorability
- Extremal results on defective colorings of graphs
- On two generalizations of the Alon-Tarsi polynomial method
- A characterization of uniquely vertex colorable graphs using minimal defining sets
- Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs
- Title not available (Why is that?)
- On path-chromatically unique graphs
- Graph theory
- A note on graph colouring
- Perfectly contractile graphs
- On uniquely partitionable planar graphs
- Disjoint independent dominating sets in graphs
- On colorings of graphs without short cycles
- Uniquely colorable graphs
- Uniquely k-arborable graphs
- On the order of uniquely (k,m)-colourable graphs
- Walkwise and admissible mappings between digraphs
- On graphs uniquely colorable under the action of their automorphism groups
- Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
- Some classes of uniquely 3-colorable graphs
- Title not available (Why is that?)
- On critical uniquely colorable graphs
- Note on the uniquely colorable graphs
- A note on uniquely 3-colourable planar graphs
- Uniquely colorable graphs with equal chromatic and game chromatic numbers
This page was built for publication: Uniquely colorable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5565634)