On the equitable vertex arboricity of graphs

DOI10.1080/00207160.2015.1023794zbMath1342.05051OpenAlexW1985004026MaRDI QIDQ5739585

Fangyun Tao, Wensong Lin

Publication date: 19 July 2016

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2015.1023794

zbMATH Keywords

complete bipartite graphplanar graphvertex \(k\)-arboricityequitable colouring\(k\)-tree-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Equitable vertex arboricity of graphs
• Conflict-free star-access in parallel memory systems
• Equitable list colorings of planar graphs without short cycles
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Mutual exclusion scheduling
• Choosability and edge choosability of planar graphs without five cycles
• A note on relaxed equitable coloring of graphs
• Perfect Graphs and an Application to Optimizing Municipal Services

This page was built for publication: On the equitable vertex arboricity of graphs