On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5915780): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2016.08.004 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of edge intersection graphs of single-bend paths on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge intersection graphs of systems of paths on a grid with a bounded number of bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural results on circular-arc graphs and circle graphs: a survey and the main open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for B 1-EPG Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge intersection graphs of single bend paths on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single bend paths on a grid have strong helly number 4: <i>errata atque emendationes ad</i> “edge intersection graphs of single bend paths on a grid” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-intersection graphs of grid paths: the bend-number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bend-number of planar and outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal Helly circular-arc graphs and its subclasses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and recognition of circular-arc graphs and subclasses: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing circular-arc graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2016.08.004 / rank
 
Normal rank

Latest revision as of 03:29, 11 December 2024

scientific article; zbMATH DE number 6820600
Language Label Description Also known as
English
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
scientific article; zbMATH DE number 6820600

    Statements

    On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 2017
    0 references
    edge intersection graphs
    0 references
    paths on a grid
    0 references
    forbidden induced subgraphs
    0 references
    normal, Helly circular-arc graphs
    0 references
    powers of cycles
    0 references
    0 references
    0 references

    Identifiers