Construction of uniquely vertex k-colorable graphs with minimum possible size

DOI10.1007/S11741-007-0502-3zbMATH Open1156.05316OpenAlexW2078754575MaRDI QIDQ5456311FDOQ5456311

Min Zhao, Liying Kang

Publication date: 4 April 2008

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-007-0502-3

Recommendations

• scientific article; zbMATH DE number 1309148
• \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
• A characterization of uniquely vertex colorable graphs using minimal defining sets
• A construction of uniquely colourable graphs with equal colour class sizes
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• The size of uniquely colorable graphs
• scientific article; zbMATH DE number 3914344
• scientific article; zbMATH DE number 4004207
• A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth
• The existence of uniquely \(-G\) colourable graphs

zbMATH Keywords

\(k\)-colorableuniquely vertex \(k\)-colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Forcing structures and cliques in uniquely vertex colorable graphs
• On uniquely 3-colorable graphs
• The size of uniquely colorable graphs
• \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
• Uniquely colorable graphs

Cited In (5)

• \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
• On uniquely \(3\)-colorable graphs. II
• On two generalizations of the Alon-Tarsi polynomial method
• Title not available (Why is that?)
• The construction of a special type of weak uniquely colorable B-hypergraphs and the minimum vertex number

This page was built for publication: Construction of uniquely vertex k-colorable graphs with minimum possible size

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