Outer 1-planar graphs (Q289919): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Franz-Josef Brandenburg / rank
Normal rank
 
Property / author
 
Property / author: Franz-Josef Brandenburg / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-015-0002-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093843500 / rank
 
Normal rank
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: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Outer 1-Planar Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Planarity of Graphs with a Rotation System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of 1-Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Density of Maximal 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of 1-planar graphs / 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: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small area drawings of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Queue Number of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density of straight-line 1-planar graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layout of Graphs with Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Right angle crossing graphs and 1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laying Out Graphs Using Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing number is hard for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Testing Outer-1-Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fáry’s Theorem for 1-Planar Graphs / 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: Linear algorithms to recognize outerplanar and maximal outerplanar 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: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity and duality of finite and infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kuratowski's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear drawings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Kuratowski Subgraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:50, 12 July 2024

scientific article
Language Label Description Also known as
English
Outer 1-planar graphs
scientific article

    Statements

    Outer 1-planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 May 2016
    0 references
    planar and outerplanar graphs
    0 references
    1-planarity
    0 references
    embeddings and drawings
    0 references
    graph parameters
    0 references
    density
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers