On the thickness and arboricity of a graph

DOI10.1016/0095-8956(91)90100-XzbMath0675.05042WikidataQ56689313 ScholiaQ56689313MaRDI QIDQ1121907

Edward R. Scheinerman, Alice M. Dean, Joan P. Hutchinson

Publication date: 1991

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

graphthicknessarboricity

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (14)

The thickness of amalgamations and Cartesian product of graphs ⋮ \(k\)-connectivity and decomposition of graphs into forests ⋮ A simulated annealing algorithm for the maximum planar subgraph problem ⋮ The thickness of a minor-excluded class of graphs ⋮ Regularity of symbolic powers and arboricity of matroids ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ Interval colorings of graphs—Coordinated and unstable no‐wait schedules ⋮ Geometric thickness in a grid ⋮ Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method ⋮ Remarks on the thickness of a graph ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ Geometric Thickness in a Grid of Linear Area ⋮ A genetic algorithm for determining the thickness of a graph ⋮ Remarks on the thickness and outerthickness of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Décomposition de \(K_16\) en trois graphes planaires
• Arboricity and Subgraph Listing Algorithms
• The maximum interval number of graphs with given genus
• The Thickness of the Complete Graph
• Decomposition of Finite Graphs Into Forests

This page was built for publication: On the thickness and arboricity of a graph