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

DOI10.1016/j.ipl.2016.08.007zbMath1388.05179arXiv1506.03913OpenAlexW2963537481MaRDI QIDQ318921

Kittikorn Nakprasit, Keaitsuda Maneeruk Nakprasit

Publication date: 6 October 2016

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

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

zbMATH Keywords

subdivisioncombinatorial problemsgraph algorithmscomplete bipartite graphsstrong chromatic indexincidence coloringcomplete tripartite graphsvertex \(k\)-arboricitystrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Strong edge chromatic index of the generalized Petersen graphs ⋮ On the complexity of the flow coloring problem ⋮ Strong chromatic index of subcubic planar multigraphs ⋮ On incidence choosability of cubic graphs

Cites Work

• Equitable vertex arboricity of graphs
• Equitable \(\Delta\)-coloring of graphs
• The equitable vertex arboricity of complete tripartite graphs
• On equitable and equitable list colorings of series-parallel graphs
• On induced matchings
• Equitable colorings of planar graphs with maximum degree at least nine
• Induced matchings in bipartite graphs
• A note on the strong chromatic index of bipartite graphs
• Equitable list colorings of planar graphs without short cycles
• The strong chromatic index of a class of graphs
• Equitable list coloring of planar graphs without 4- and 6-cycles
• The strong chromatic index of a cubic graph is at most 10
• Incidence and strong edge colorings of graphs
• Equitable coloring and the maximum degree
• Equitable colorings of outerplanar graphs
• On equitable coloring of bipartite graphs
• Equitable colorings of planar graphs without short cycles
• A note on relaxed equitable coloring of graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong chromatic index of subset graphs
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Equitable Coloring
• Induced matchings in cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs