Pages that link to "Item:Q1377702"
From MaRDI portal
The following pages link to The existence of uniquely \(-G\) colourable graphs (Q1377702):
Displaying 16 items.
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- On the order of uniquely (k,m)-colourable graphs (Q923092) (← links)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- On the existence of graphs with prescribed coloring parameters (Q1567294) (← links)
- On small uniquely vertex-colourable graphs and Xu's conjecture (Q1587598) (← links)
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges (Q1850550) (← links)
- (Q3699709) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- (Q4892340) (← links)
- Generalized Coloring of Permutations (Q5009614) (← links)
- A note on uniquely H-colorable graphs (Q5444054) (← links)
- Construction of uniquely vertex k-colorable graphs with minimum possible size (Q5456311) (← links)
- (Q5708600) (← links)
- Construction of sparse graphs with prescribed circular colorings (Q5936037) (← links)
- On the existence of graphs which can colour every regular graph (Q6162043) (← links)
- Generalized coloring of permutations (Q6582372) (← links)