Uniquely colorable graphs

DOI10.1016/S0021-9800(69)80086-4zbMath0175.50205OpenAlexW1987231262MaRDI QIDQ5565634

Stephen T. Hedetniemi, Frank Harary, Robert 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

zbMATH Keywords

topology

Related Items

Unnamed Item, Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs, On graphs uniquely colorable under the action of their automorphism groups, On path-chromatically unique graphs, Constructing uniquely realizable graphs, The size of edge-critical uniquely 3-colorable planar graphs, Uniquely colorable graphs up to automorphisms, Size of edge-critical uniquely 3-colorable planar graphs, On two generalizations of the Alon-Tarsi polynomial method, On the order of uniquely (k,m)-colourable graphs, A construction of uniquely colourable graphs with equal colour class sizes, On uniquely 3-colorable graphs, Some classes of uniquely 3-colorable graphs, A relation between choosability and uniquely list colorability, Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs, Disjoint independent dominating sets in graphs, On infinite graphs with a specified number of colorings, Uniqueness of colorings, Graph theory, Uniquely colorable graphs, On colorings of graphs without short cycles, A note on uniquely 3-colourable planar graphs, Uniquely k-arborable graphs, Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph), Unnamed Item, On critical uniquely colorable graphs, Note on the uniquely colorable graphs, A note on graph colouring, A characterization of uniquely vertex colorable graphs using minimal defining sets, On uniquely partitionable planar graphs, Defining sets and uniqueness in graph colorings: A survey, Walkwise and admissible mappings between digraphs, Graphs with coloring redundant edges, \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges, Perfectly contractile graphs, Uniquely colorable graphs with equal chromatic and game chromatic numbers, Extremal results on defective colorings of graphs, Applications of Hajós‐Type Constructions to the Hedetniemi Conjecture