On the equitable vertex arboricity of complete tripartite graphs

DOI10.1142/S1793830915500561zbMath1331.05062MaRDI QIDQ2788734

Yaping Mao, Zhi-Wei Guo, Hai-xing Zhao

Publication date: 22 February 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

equitable coloringvertex \(k\)-arboricity\(k\)-tree-coloringcomplete equipartition tripartite graph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• The equitable vertex arboricity of complete tripartite graphs
• Conflict-free star-access in parallel memory systems
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Mutual exclusion scheduling
• A note on relaxed equitable coloring of graphs
• Equitable Coloring
• Perfect Graphs and an Application to Optimizing Municipal Services

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