Equitable partition of plane graphs with independent crossings into induced forests

DOI10.1016/j.disc.2019.111792zbMath1435.05148arXiv1903.08337OpenAlexW2999682367WikidataQ126387162 ScholiaQ126387162MaRDI QIDQ2305905

Xin Zhang, Bei Niu, Yu-ping Gao

Publication date: 20 March 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

planar graphequitable partitionvertex arboricityIC-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

On Equitable List Arboricity of Graphs, Hardness and algorithms of equitable tree-coloring problem in chordal graphs, Theoretical aspects of equitable partition of networks into sparse modules, Complexity of tree-coloring interval graphs equitably, Equitable partition of graphs into induced linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable vertex arboricity of subcubic graphs
• Equitable vertex arboricity of graphs
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• Equitable vertex arboricity of planar graphs
• A note on relaxed equitable coloring of graphs
• Tree-coloring problems of bounded treewidth graphs
• Equitable partition of graphs into induced linear forests
• Equitable partition of graphs into induced forests
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• Equitable vertex arboricity of 5-degenerate graphs
• A conjecture on equitable vertex arboricity of graphs
• Coloring plane graphs with independent crossings
• Chromatic number, independence ratio, and crossing number
• A new proof of the 6 color theorem
• Acyclic colouring of 1-planar graphs