On the order of uniquely (k,m)-colourable graphs

DOI10.1016/0012-365X(90)90200-2zbMATH Open0712.05024OpenAlexW1966409080MaRDI QIDQ923092FDOQ923092

Authors: Izak Broere, Marietjie Frick 

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90200-2

Recommendations

• scientific article; zbMATH DE number 3924805
• scientific article; zbMATH DE number 4043873
• On uniquely 3-colorable graphs
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• The existence of uniquely \(-G\) colourable graphs

zbMATH Keywords

m-admissible colouringuniquely (k,m)-colourable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Some covering concepts in graphs
• Title not available (Why is that?)
• Uniquely colorable graphs
• Title not available (Why is that?)
• A Theorem on k-Saturated Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Uniquely colourable m-dichromatic oriented graphs
• Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
• On uniquely 3-colorable graphs
• TWO RESULTS ON GENERALIZED CHROMATIC NUMBERS
• Title not available (Why is that?)
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• Title not available (Why is that?)
• Title not available (Why is that?)
• On uniquely partitionable planar graphs
• Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs

This page was built for publication: On the order of uniquely (k,m)-colourable graphs

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