Pages that link to "Item:Q1045049"

The following pages link to Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049):

Displaying 25 items.

• Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection (Q344830) (← links)
• Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
• Boxicity of circular arc graphs (Q659754) (← links)
• A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
• Dual parameterization of weighted coloring (Q786042) (← links)
• The clique operator on circular-arc graphs (Q987670) (← links)
• Canonical representations for circular-arc graphs using flip sets (Q1799215) (← links)
• Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
• Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
• Subclasses of circular-arc bigraphs: Helly, normal and proper (Q2132386) (← 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)
• The Vietoris-Rips complexes of a circle (Q2363585) (← 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)
• Interval Routing Schemes for Circular-Arc Graphs (Q2979675) (← links)
• On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
• The Persistent Homology of Cyclic Graphs (Q5057657) (← links)
• Partial Characterizations of 1‐Perfectly Orientable Graphs (Q5272923) (← links)
• On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5890935) (← links)
• On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5915780) (← links)
• Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)
• Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)