scientific article; zbMATH DE number 3924805

zbMATH Open0578.05024MaRDI QIDQ3699709FDOQ3699709

Authors:

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• A survey on uniquely colorable graphs
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• Results on uniquely colorable digraphs
• scientific article; zbMATH DE number 4004207
• A note on uniquely H-colorable graphs
• Two conjectures on uniquely totally colorable graphs
• scientific article; zbMATH DE number 742643
• On a conjecture about uniquely colorable perfect graphs
• The existence of uniquely \(-G\) colourable graphs
• Uniquely total colorable graphs

zbMATH Keywords

chromatic numberextremal problemsuniquely colourable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (28)

• Title not available (Why is that?)
• A construction of uniquely colourable graphs with equal colour class sizes
• Title not available (Why is that?)
• Unique list-colourability and the fixing chromatic number of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A map colour theorem for the union of graphs
• Defining sets and uniqueness in graph colorings: A survey
• On uniquely \(3\)-colorable graphs. II
• Set colourings of graphs. (Reprint)
• Uniquely \(n\)-colorable and chromatically equivalent graphs
• Uniquely colorable Cayley graphs
• Title not available (Why is that?)
• The size of uniquely colorable graphs
• Title not available (Why is that?)
• A note on uniquely H-colorable graphs
• On Garlands in \(\chi\)-uniquely colorable graphs
• Title not available (Why is that?)
• An algebraic approach for counting DP-3-colorings of sparse graphs
• Results on uniquely colorable digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the order of uniquely (k,m)-colourable graphs
• DOWNWARD UNARY COLORINGS
• Uniquely total colorable graphs
• Unique Colorability and Clique Minors
• Title not available (Why is that?)
• On small uniquely vertex-colourable graphs and Xu's conjecture

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3699709)