\(\mathsf{NIC}\)-planar graphs (Q2410219): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964235359 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1701.04375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in quasi-planar graphs / 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: Chromatic number, independence ratio, and crossing number / 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: Outer 1-planar graphs / 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: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über 1-optimale Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing and drawing IC-planar graphs / 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: Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing hole-free 4-map graphs in cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs with right angle crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Thickness of Complete Graphs / 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: Algorithms for graphs embeddable with few crossings per edge / 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: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring plane graphs with independent crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of simple complete topological graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Struktur 1‐planarer Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal 1-planar graphs which triangulate other surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-embeddings of Maximum 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing complete multipartite graphs on the plane with restrictions on crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of plane graphs with independent crossings and its applications to coloring problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:25, 14 July 2024

scientific article
Language Label Description Also known as
English
\(\mathsf{NIC}\)-planar graphs
scientific article

    Statements

    \(\mathsf{NIC}\)-planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    NIC-planarity
    0 references
    density
    0 references
    recognition
    0 references
    \(1\)-planarity
    0 references
    right-angle crossings
    0 references
    0 references
    0 references
    0 references

    Identifiers

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