The equitable vertex arboricity of complete tripartite graphs
From MaRDI portal
Publication:495689
DOI10.1016/J.IPL.2015.06.016zbMATH Open1338.05083arXiv1506.03530OpenAlexW1996926486MaRDI QIDQ495689FDOQ495689
Authors: Yaping Mao, Zhiwei Guo, Haixing Zhao 
Publication date: 15 September 2015
Published in: Information Processing Letters (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1506.03530
Recommendations
equitable coloringcombinatorial problemsvertex \(k\)-arboricitycomplete tripartite graph\(k\)-tree-coloring
Cites Work
- Title not available (Why is that?)
- Equitable vertex arboricity of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on relaxed equitable coloring of graphs
- Equitable Coloring
- An existential problem of a weight-controlled subset and its application to school timetable construction
- Mutual exclusion scheduling
- Perfect Graphs and an Application to Optimizing Municipal Services
- Conflict-free star-access in parallel memory systems
- Title not available (Why is that?)
Cited In (2)
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)
