On (0, 1)-relaxed strong edge-coloring of sparse graphs

MaRDI QIDQ5129331zbMATH OpenFDO

Authors Cunsu Liu

Publication date 27 October 2020

zbMATH Keywords

girthplanar graphsmaximum average degreerelaxed strong \(k\)-edge-coloringrelaxed strong chromatic index

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On \((1, 0)\)-relaxed strong edge-coloring of graphs
• On \((s,t)\)-relaxed strong edge-coloring of graphs
• \((1, 0)\)-relaxed strong edge list coloring of planar graphs with girth \(6\)
• Strong edge-colorings of sparse graphs with large maximum degree
• A \((1,0)\)-relaxed strong list coloring of planar subcubic graphs

Cited in

(5)

• A \((1,0)\)-relaxed strong list coloring of planar subcubic graphs
• Strong edge-colorings of sparse graphs with large maximum degree
• On \((1, 0)\)-relaxed strong edge-coloring of graphs
• \((1, 0)\)-relaxed strong edge list coloring of planar graphs with girth \(6\)
• On \((s,t)\)-relaxed strong edge-coloring of graphs

This page was built for publication: On \((0, 1)\)-relaxed strong edge-coloring of sparse graphs

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