The equitable vertex arboricity of complete tripartite graphs

DOI10.1016/J.IPL.2015.06.016zbMATH Open1338.05083OpenAlexW1996926486MaRDI QIDQ495689FDOQ495689

Authors Yaping Mao, Zhiwei Guo, Haixing Zhao

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

equitable coloringcombinatorial problemsvertex \(k\)-arboricitycomplete tripartite graph\(k\)-tree-coloring

Mathematics Subject Classification ID

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

Abstract: The equitable coloring problem, introduced by Meyer in 1973, has received considerable attention and research. Recently, Wu et al. introduced the concept of equitable (t,k)-tree-coloring, which can be viewed as a generalization of proper equitable t-coloring. The strong equitable vertex k-arboricity of complete bipartite equipartition graphs was investigated in 2013. In this paper, we study the exact value of the strong equitable vertex 3-arboricity of complete equipartition tripartite graphs.

Recommendations

• On the equitable vertex arboricity of complete tripartite graphs
• On the equitable vertex arboricity of complete bipartite graphs
• On the equitable vertex arboricity of graphs
• Equitable vertex arboricity of graphs

Cites work

• scientific article; zbMATH DE number 1640601 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 949303 (Why is no real title available?)
• scientific article; zbMATH DE number 871903 (Why is no real title available?)
• A note on relaxed equitable coloring of graphs
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Conflict-free star-access in parallel memory systems
• Equitable Coloring
• Equitable vertex arboricity of graphs
• Mutual exclusion scheduling
• Perfect Graphs and an Application to Optimizing Municipal Services

Cited in

(2)

• On the equitable vertex arboricity of complete tripartite graphs
• On the equitable vertex arboricity of complete bipartite graphs

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

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