The book thickness of 1-planar graphs is constant (Q2408921): Difference between revisions

From MaRDI portal
Merged Item from Q3452776
Created claim: DBLP publication ID (P1635): conf/esa/BekosB0R15, #quickstatements; #temporary_batch_1731508824982
 
(2 intermediate revisions by one other user not shown)
Property / cites work
 
Property / cites work: Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Page Book Embeddings of 4-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of 1-planar graphs is constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über 1-optimale Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halin graphs and the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph treewidth and geometric thickness parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for graphs embeddable with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of a theorem of Whitney / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genus g Graphs Have Pagenumber O(√g) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with E Edges Have Pagenumber O(√E) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with small book thickness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs in four pages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs drawn with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on graphs / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/esa/BekosB0R15 / rank
 
Normal rank

Latest revision as of 16:09, 13 November 2024

scientific article; zbMATH DE number 6511764
  • 1-Planar Graphs have Constant Book Thickness
Language Label Description Also known as
English
The book thickness of 1-planar graphs is constant
scientific article; zbMATH DE number 6511764
  • 1-Planar Graphs have Constant Book Thickness

Statements

The book thickness of 1-planar graphs is constant (English)
0 references
1-Planar Graphs have Constant Book Thickness (English)
0 references
0 references
0 references
0 references
0 references
0 references
10 October 2017
0 references
19 November 2015
0 references
book embeddings
0 references
page number
0 references
1-planar graphs
0 references
bounded book thickness
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references