The equitable vertex arboricity of complete tripartite graphs

DOI10.1016/j.ipl.2015.06.016zbMath1338.05083arXiv1506.03530OpenAlexW1996926486MaRDI QIDQ495689

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

Publication date: 15 September 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.03530

zbMATH Keywords

combinatorial problemsequitable coloringvertex \(k\)-arboricitycomplete tripartite graph\(k\)-tree-coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ On the equitable vertex arboricity of complete tripartite graphs

Cites Work

• Equitable vertex arboricity of 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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