Uniquely colorable graphs
From MaRDI portal
(Redirected from Publication:5565634)
Uniquely colorable graphs (scientific article; zbMATH DE number 3280721)
Uniquely colorable graphs (scientific article; zbMATH DE number 3280721)
Cited in
(40)- 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
- Uniqueness of colorings
- Graphs with coloring redundant edges
- Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)
- Uniquely colorable graphs up to automorphisms
- Size of edge-critical uniquely 3-colorable planar graphs
- Defining sets and uniqueness in graph colorings: A survey
- Distance dominator packing coloring of type II
- 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
- scientific article; zbMATH DE number 2230304 (Why is no real title available?)
- Applications of Hajós-type constructions to the Hedetniemi conjecture
- 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
- Uniquely proper distinguishing colorable graphs
- 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
- On critical uniquely colorable graphs
- Note on the uniquely colorable graphs
- scientific article; zbMATH DE number 7145382 (Why is no real title available?)
- 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)