Geometric biplane graphs. I: Maximal graphs (Q2345511): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Alfredo Daniel Garcia / rank
 
Normal rank
Property / author
 
Property / author: Ferran Hurtado / rank
 
Normal rank
Property / author
 
Property / author: F. Javier Tejel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987580358 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1702.01275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting the connectivity of geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Tri-Connected Planar Straight Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting the edge connectivity of planar straight line graphs to three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biplanar graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The boundary and the shape of binary images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Thickness of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages / 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: Testing bipartiteness of geometric intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric biplane graphs. I: Maximal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric biplane graphs. II: Graph augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration and limit laws of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Plane Graphs: Flippability and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane Geometric Graph Augmentation: A Generic Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: On representations of some thickness-two 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: Generalized Delaunay triangulation for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting the Connectivity of Planar and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting triangulations of planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity augmentation in planar straight line graphs / rank
 
Normal rank

Latest revision as of 03:38, 10 July 2024

scientific article
Language Label Description Also known as
English
Geometric biplane graphs. I: Maximal graphs
scientific article

    Statements

    Geometric biplane graphs. I: Maximal graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    geometric graphs
    0 references
    biplane graphs
    0 references
    maximal biplane graphs
    0 references
    \(k\)-connected graphs
    0 references
    graph augmentation
    0 references
    0 references
    0 references