Thickness and outerthickness for embedded graphs

DOI10.1016/j.disc.2018.02.024zbMath1384.05075arXiv1512.04995OpenAlexW2964316365WikidataQ130049252 ScholiaQ130049252MaRDI QIDQ1744754

Xiaoya Zha, Bao-Gang Xu

Publication date: 19 April 2018

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

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

zbMATH Keywords

surfacedecompositionplanar graphouterplanar 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) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Thickness of the subgroup intersection graph of a finite group ⋮ Partial-dual Euler-genus distributions for bouquets with small Euler genus ⋮ On the Bar Visibility Number of Complete Bipartite Graphs

Cites Work

• On the genus and thickness of graphs
• The thickness of a minor-excluded class of graphs
• The thickness of graphs: A survey
• Surfaces, tree-width, clique-minors, and partitions
• Outerplanar partitions of planar graphs
• Graphs with forbidden subgraphs
• Edge partition of planar sraphs into two outerplanar graphs
• Determining the thickness of graphs is NP-hard
• THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH
• Die dicke des n-dimensionalen Würfel-graphen
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Thickness and outerthickness for embedded graphs