Incidence colorings of series-parallel graphs and Meredith graphs

zbMATH Open1199.05142MaRDI QIDQ3640975FDOQ3640975

Authors: Fangfang Ma, Li-Jun Yang, Shudong Wang 

Publication date: 11 November 2009

Recommendations

• Acyclic edge coloring of series-parallel graphs and Meredith graphs
• On the maximum average degree and the incidence chromatic number
• Incidence coloring -- cold cases
• Incidence coloring of mycielskians with fast algorithm
• Incidence coloring of the join graphs

zbMATH Keywords

incidence coloringseries-parallel graphincidence chromatic numberMeredith graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (2)

• Acyclic edge coloring of series-parallel graphs and Meredith graphs
• Multicolorings of series-parallel graphs

This page was built for publication: Incidence colorings of series-parallel graphs and Meredith graphs

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