On the planar split thickness of graphs (Q1742373): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Created claim: DBLP publication ID (P1635): journals/algorithmica/EppsteinKKLLMMV18, #quickstatements; #temporary_batch_1731461124002
 
(7 intermediate revisions by 6 users not shown)
aliases / en / 0aliases / en / 0
 
On the Planar Split Thickness of Graphs
description / endescription / en
scientific article
scientific article; zbMATH DE number 6576684
Property / title
 
On the Planar Split Thickness of Graphs (English)
Property / title: On the Planar Split Thickness of Graphs (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1383.68060 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-49529-2_30 / rank
 
Normal rank
Property / author
 
Property / author: Stephen G. Kobourov / rank
 
Normal rank
Property / author
 
Property / author: S. H. Whitesides / rank
 
Normal rank
Property / author
 
Property / author: Stephen K. Wismath / rank
 
Normal rank
Property / published in
 
Property / published in: LATIN 2016: Theoretical Informatics / rank
 
Normal rank
Property / publication date
 
3 May 2016
Timestamp+2016-05-03T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 3 May 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6576684 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101895193 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2221659697 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.04839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Thickness of the Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Induced Subgraphs of Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How not to characterize planar-emulable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph treewidth and geometric thickness parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometric thickness of low degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the planar split thickness of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPLITTING NUMBER is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forests, frames, and games: Algorithms for matroid sums and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of projective-planar embeddings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toroidal splitting number of the complete graph \(K_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splitting number of the complete graph in the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splitting number of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splitting number of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three ways to cover a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncrossing Subgraphs in Topological Layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarizing Graphs - A Survey and Annotated Bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spherical genus and virtually planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Heawood's empire problem in the plane. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interval number of a planar graph: Three intervals suffice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/algorithmica/EppsteinKKLLMMV18 / rank
 
Normal rank

Latest revision as of 02:44, 13 November 2024

scientific article; zbMATH DE number 6576684
  • On the Planar Split Thickness of Graphs
Language Label Description Also known as
English
On the planar split thickness of graphs
scientific article; zbMATH DE number 6576684
  • On the Planar Split Thickness of Graphs

Statements

On the planar split thickness of graphs (English)
0 references
On the Planar Split Thickness of Graphs (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
11 April 2018
0 references
3 May 2016
0 references
planarity
0 references
splittable
0 references
thickness
0 references
graph drawing
0 references
graph theory
0 references
complete graphs
0 references
genus-1 graphs
0 references
NP-hardness
0 references
approximation
0 references
fixed-parameter tractable
0 references
0 references
0 references
0 references
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
0 references