On Garlands in -uniquely colorable graphs

DOI10.33048/SEMI.2019.16.120MaRDI QIDQ2279480zbMATH OpenOpenAlexFDO

Authors Pavel A. Gein

Publication date 12 December 2019

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

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

zbMATH Keywords

complete multipartite graphchromatic uniquenessuniquely colorable graphchromatic invariant 1

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• ON UNIQUELY -G k-COLOURABLE GRAPHS
• Uniquely cocolourable graphs
• A characterization of uniquely vertex colorable graphs using minimal defining sets
• scientific article; zbMATH DE number 3924805
• Forcing structures and cliques in uniquely vertex colorable graphs

Cites work

• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• About chromatic uniqueness of some complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs. II
• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
• The chromatic uniqueness of certain complete t-partite graphs.
• The search for chromatically unique graphs

Cited in

(3)

• Uniquely colorable graphs up to automorphisms
• On chromatic uniqueness of some complete tripartite graphs
• \(\gamma\)-chromatic partition in planar graph characterization

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

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