The following pages link to Uniquely colorable graphs (Q5565634):
Displaying 38 items.
- Constructing uniquely realizable graphs (Q393739) (← links)
- The size of edge-critical uniquely 3-colorable planar graphs (Q396890) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Perfectly contractile graphs (Q803147) (← links)
- Size of edge-critical uniquely 3-colorable planar graphs (Q906468) (← links)
- On the order of uniquely (k,m)-colourable graphs (Q923092) (← links)
- On uniquely 3-colorable graphs (Q1210549) (← links)
- Some classes of uniquely 3-colorable graphs (Q1212948) (← links)
- Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs (Q1229733) (← links)
- Disjoint independent dominating sets in graphs (Q1240740) (← links)
- On infinite graphs with a specified number of colorings (Q1243735) (← links)
- Uniqueness of colorings (Q1244242) (← links)
- Uniquely colorable graphs (Q1250828) (← links)
- On colorings of graphs without short cycles (Q1257905) (← links)
- A characterization of uniquely vertex colorable graphs using minimal defining sets (Q1297453) (← links)
- Defining sets and uniqueness in graph colorings: A survey (Q1299076) (← links)
- Extremal results on defective colorings of graphs (Q1318803) (← links)
- Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs (Q1356650) (← links)
- On graphs uniquely colorable under the action of their automorphism groups (Q1356677) (← links)
- On uniquely partitionable planar graphs (Q1584417) (← links)
- Walkwise and admissible mappings between digraphs (Q1845747) (← links)
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges (Q1850550) (← links)
- On path-chromatically unique graphs (Q1916374) (← links)
- A construction of uniquely colourable graphs with equal colour class sizes (Q1983120) (← links)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- Uniquely k-arborable graphs (Q2548256) (← links)
- Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph) (Q2548964) (← links)
- On critical uniquely colorable graphs (Q2552509) (← links)
- Note on the uniquely colorable graphs (Q2556414) (← links)
- A note on graph colouring (Q4854635) (← links)
- A note on uniquely 3-colourable planar graphs (Q4976305) (← links)
- Graphs with coloring redundant edges (Q5006591) (← links)
- (Q5206906) (← links)
- Applications of Hajós‐Type Constructions to the Hedetniemi Conjecture (Q5272936) (← links)
- (Q5708600) (← links)
- Uniquely colorable graphs with equal chromatic and game chromatic numbers (Q5866017) (← links)
- Graph theory (Q5917392) (← links)
- Uniquely colorable graphs up to automorphisms (Q6160596) (← links)
