On Garlands in \(\chi\)-uniquely colorable graphs

DOI10.33048/SEMI.2019.16.120zbMath1427.05088OpenAlexW3015519431MaRDI QIDQ2279480

Pavel A. Gein

Publication date: 12 December 2019

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2019.16.120

zbMATH Keywords

chromatic uniquenesscomplete multipartite graphuniquely colorable graphchromatic invariant 1

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• The search for chromatically unique graphs
• The chromatic uniqueness of certain complete \(t\)-partite graphs.
• About chromatic uniqueness of some complete tripartite graphs
• Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs

This page was built for publication: On Garlands in \(\chi\)-uniquely colorable graphs