Partial Characterizations of Circular-Arc Graphs
From MaRDI portal
Publication:3503529
Recommendations
- Partial characterizations of circular-arc graphs
- Partial characterizations of circle graphs
- Circular‐arc digraphs: A characterization
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
Cites work
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Efficient construction of unit circular-arc models
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Linear-time recognition of circular-arc graphs
- On chordal proper circular arc graphs
- Polynomial time recognition of unit circular-arc graphs
- Representation of a finite graph by a set of intervals on the real line
- Structure theorems for some circular-arc graphs
Cited in
(22)- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Irredundancy in circular arc graphs
- Unit Circular-Arc Graph Representations and Feasible Circulations
- Partial characterizations of circle graphs
- Boxicity of circular arc graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Balancedness of subclasses of circular-arc graphs
- Blocking quadruple: a new obstruction to circular-arc graphs
- Balancedness of some subclasses of circular-arc graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Contact Graphs of Circular Arcs
- The restricted arc-width of a graph
- The Branch-Width of Circular-Arc Graphs
- Naji's characterization of circle graphs
- Parity in knot theory
- Circular-arc hypergraphs: rigidity via connectedness
- scientific article; zbMATH DE number 1990726 (Why is no real title available?)
- Partial characterizations of circular-arc graphs
- A note on the Hadwiger number of circular arc graphs
- Proper circular arc graphs as intersection graphs of paths on a grid
- Circular‐arc digraphs: A characterization
- Forbidden induced subgraph characterization of circle graphs within split graphs
This page was built for publication: Partial Characterizations of Circular-Arc Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503529)