Thickness and connectivity in graphs
From MaRDI portal
Publication:5548827
DOI10.6028/JRES.072B.023zbMATH Open0164.24701OpenAlexW2316512113MaRDI QIDQ5548827FDOQ5548827
Jerrold W. Grossman, Arthur M. Hobbs
Publication date: 1968
Published in: Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.6028/jres.072b.023
Recommendations
- Thickness and Antithickness of Graphs
- The thickness of graphs: A survey
- On the thickness of graphs of given degree
- Thickness and outerthickness for embedded graphs
- Geometric Thickness of Complete Graphs
- On the thickness and arboricity of a graph
- Remarks on the thickness of a graph
- The thickness of the join graphs
- Remarks on the thickness and outerthickness of a graph
- The geometric thickness of low degree graphs
Cited In (10)
- Title not available (Why is that?)
- Thickness and Antithickness of Graphs
- Thickness and outerthickness for embedded graphs
- A note on Halton's conjecture
- Title not available (Why is that?)
- A construction of thickness-minimal graphs
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Title not available (Why is that?)
- A class of thickness-minimal graphs
- Precedence thinness in graphs
This page was built for publication: Thickness and connectivity in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5548827)
