On the thickness of graphs of given degree (Q1174334): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: B. Andrasfai / rank | |||
Property / reviewed by | |||
Property / reviewed by: B. Andrasfai / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every planar graph with nine points has a nonplanar complement / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3684165 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Thickness of the Complete Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5732335 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3277097 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3883524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing an st-numbering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Dual form of Kuratowski's Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5596083 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5528475 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How to Draw a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Non-Biplanar Character of the Complete 9-Graph / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0255(91)90052-v / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1996855544 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:46, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the thickness of graphs of given degree |
scientific article |
Statements
On the thickness of graphs of given degree (English)
0 references
25 June 1992
0 references
The results presented here refer to the determination of the thickness of a graph, that is, the minimum number of planar subgraphs into which the graph can be decomposed. Let \(D\) and \(T\) be positive integers, such that any graph of degree at most \(D\) has thickness at most \(T\). The author proves the following: (1) A planar graph has a planar representation for any arbitrary placement of its nodes in the plane. (2) Any graph of degree \(d\) has thickness at most \(T\lceil(d+2)/D\rceil\). (3) Any graph of degree \(d\) can always be embedded in a regular graph of any degree \(f\geq d\). (4) Any graph of degree \(d\) has thickness at most \(\lceil d/2\rceil\). (5) \(D\leq 4T-2\).
0 references
thickness of graphs
0 references
degree
0 references
0 references