The equitable edge-colouring of outerplanar graphs

MaRDI QIDQ2721339zbMATH OpenFDO

Authors Jian-Liang Wu

Publication date 2 July 2001

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

equitable edge-colouringouterplanar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

It is shown that any outerplanar graph has an equitable edge-colouring with \(k\) colours for any integer \(k\geq 3\).

Recommendations

• Equitable colorings of outerplanar graphs
• scientific article; zbMATH DE number 6470667
• On the equitable edge-coloring of 1-planar graphs and planar graphs
• Equitable edge-colorings of simple graphs
• On equitable edge-coloring of multigraphs
• scientific article; zbMATH DE number 1308943
• scientific article; zbMATH DE number 1556203
• scientific article; zbMATH DE number 1302199
• scientific article; zbMATH DE number 1159426
• scientific article; zbMATH DE number 2016735

Cited in

(2)

• On the equitable edge-coloring of 1-planar graphs and planar graphs
• scientific article; zbMATH DE number 2016735 (Why is no real title available?)

This page was built for publication: The equitable edge-colouring of outerplanar graphs

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