K_r-free uniquely vertex colorable graphs with minimum possible edges

DOI10.1006/JCTB.2000.2028zbMATH Open1027.05040OpenAlexW2050101460MaRDI QIDQ1850550FDOQ1850550

Authors: B. S. Sadjad, S. Akbari, Vahab S. Mirrokni 

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.2028

Recommendations

• Construction of uniquely vertex k-colorable graphs with minimum possible size
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• scientific article; zbMATH DE number 3914344
• A characterization of uniquely vertex colorable graphs using minimal defining sets
• scientific article; zbMATH DE number 4004207
• scientific article; zbMATH DE number 572161
• scientific article; zbMATH DE number 6604949
• Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
• The existence of uniquely \(-G\) colourable graphs
• Uniquely \(n\)-colorable and chromatically equivalent graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Uniquely Colourable Graphs with Large Girth
• Uniquely colorable graphs
• On uniquely 3-colorable graphs
• The size of uniquely colorable graphs
• Title not available (Why is that?)

Cited In (7)

• A construction of uniquely colourable graphs with equal colour class sizes
• Algebraic characterization of uniquely vertex colorable graphs
• A relation between choosability and uniquely list colorability
• On two generalizations of the Alon-Tarsi polynomial method
• Title not available (Why is that?)
• Construction of uniquely vertex k-colorable graphs with minimum possible size
• Title not available (Why is that?)

This page was built for publication: \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges

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