Pages that link to "Item:Q2563173"
From MaRDI portal
The following pages link to Structure theorems for some circular-arc graphs (Q2563173):
Displaying 49 items.
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Cyclic orders (Q583246) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- An extension of a fixed point problem for simple graphs (Q686510) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Representation theorems for graphs whose vertex set is partially ordered (Q762181) (← links)
- On a circle-cover minimization problem (Q790622) (← links)
- Circular representation problem on hypergraphs (Q799695) (← links)
- New characterizations of proper interval bigraphs (Q896097) (← links)
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (Q967378) (← links)
- Hadwiger's conjecture for proper circular arc graphs (Q1024291) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- An O(qn) algorithm to q-color a proper family of circular arcs (Q1060020) (← links)
- Circular-arc graphs with clique cover number two (Q1078197) (← links)
- On the problem of how to represent a graph taking into account an additional structure (Q1101469) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs (Q1208345) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Essential obstacles to Helly circular-arc graphs (Q2166233) (← links)
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Graphs and digraphs represented by intervals and circular arcs (Q2357159) (← links)
- Proper circular arc graphs as intersection graphs of paths on a grid (Q2416437) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Unit ball graphs on geodesic spaces (Q2657071) (← links)
- Unit interval graphs: a story with open ends (Q2857436) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms (Q2985116) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- Partial Characterizations of Circular-Arc Graphs (Q3503529) (← links)
- Proper Helly Circular-Arc Graphs (Q3508572) (← links)
- Partial characterizations of circular-arc graphs (Q3652535) (← links)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133) (← links)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)
- Unit Interval Graphs of Open and Closed Intervals (Q4916100) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- From a Circular-Arc Model to a Proper Circular-Arc Model (Q5302066) (← links)
- Circular‐Arc Bigraphs and Its Subclasses (Q5325948) (← links)
- An approximation result for a periodic allocation problem (Q5946816) (← links)
- Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)