Upper bound on chromatic number of square graph of sparse graphs

DOI10.13413/J.CNKI.JDXBLXB.2019315MaRDI QIDQ3385887zbMATH OpenFDO

Authors Yan Zhang

Publication date 14 January 2021

Full work available at URL https://doi.org/10.13413/J.CNKI.JDXBLXB.2019315

zbMATH Keywords

\(k\)-vertex-coloringchromatic numbermaximum average degreesquare graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• New upper bound on the chromatic number of the square of a planar graph
• Coloring the square of a sparse graph G with almost (G) colors
• Coloring squares of graphs with mad constraints
• Chromatic number of square of maximal outerplanar graphs
• Coloring the square of graphs whose maximum average degree is less than 4

Cited in

(7)

• Coloring squares of graphs with mad constraints
• New upper bound on the chromatic number of the square of a planar graph
• Coloring the square of a sparse graph G with almost (G) colors
• The Chromatic Number of Graph Powers
• Precise upper bound for the strong edge chromatic number of sparse planar graphs
• Coloring squares of graphs via vertex orderings
• Coloring the square of graphs whose maximum average degree is less than 4

This page was built for publication: Upper bound on chromatic number of square graph of sparse graphs

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