Contact Graphs of Circular Arcs (Q3449800): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Proportional Contact Representations of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Circle Packings for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contact Graphs of Circular Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bijection for triangulations, quadrangulations, pentagulations, etc. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-Free Planar Graphs and Segment Intersection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On topological aspects of orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barycentric systems and stretchability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations by contact and intersection of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal polygonal representation of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area-Universal and Constrained Rectangular Layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle contact representations and duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar minimally rigid graphs and pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes and recognition of curve contact graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebble game algorithms and sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight triangulation is NP-hard / 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: An Inductive Construction of (2,1)-tight Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs with Few Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717849 / rank
 
Normal rank

Latest revision as of 00:24, 11 July 2024

scientific article
Language Label Description Also known as
English
Contact Graphs of Circular Arcs
scientific article

    Statements

    Contact Graphs of Circular Arcs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 October 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references