Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
From MaRDI portal
Publication:2448877
Recommendations
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- On some subclasses of circular-arc graphs
- On circular-perfect graphs: a survey
- Partial characterizations of circular-arc graphs
- Partial Characterizations of Circular-Arc Graphs
- A note on the Hadwiger number of circular arc graphs
- Circular-arc bigraphs and its subclasses
- Circular‐arc digraphs: A characterization
- Restricted circular-arc graphs and clique cycles
- Circular-arc hypergraphs: rigidity via connectedness
Cites work
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 1375584 (Why is no real title available?)
- scientific article; zbMATH DE number 4116566 (Why is no real title available?)
- scientific article; zbMATH DE number 2096438 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3420624 (Why is no real title available?)
- A New Class of Brittle Graphs
- A characterization of circle graphs
- A proof of a circle graph characterization
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- Algorithmic graph theory and perfect graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- An Efficient Test for Circular-Arc Graphs
- An approximation result for a periodic allocation problem
- Bipartite graphs that are not circle graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Characterizing circular-arc graphs
- Circle graph obstructions
- Circle graph obstructions under pivoting
- Circular-arc graphs with clique cover number two
- Coloring perfect \((K_ 4\)-e)-free graphs
- Decomposition of Directed Graphs
- Detecting a Theta or a Prism
- Diamond-free circle graphs are Helly circle
- Efficient construction of unit circular-arc models
- Incidence matrices and interval graphs
- Interval bigraphs and circular arc graphs
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
- Linear-time recognition of Helly circular-arc models and graphs
- Linear-time recognition of circular-arc graphs
- List homomorphisms and circular arc graphs
- Locally semicomplete digraphs: A generalization of tournaments
- Matrix characterizations of circular-arc graphs
- On Graphs Without Multicliqual Edges
- On a unique tree representation for \(P_ 4\)-extendible graphs
- On chordal proper circular arc graphs
- Partial characterizations of circle graphs
- Partial characterizations of circular-arc graphs
- Paw-free graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Permutation Graphs and Transitive Graphs
- Polynomial time recognition of unit circular-arc graphs
- Proper Helly Circular-Arc Graphs
- Recognition of Circle Graphs
- Recognizing circle graphs in polynomial time
- Reconnaissance des graphes de cordes
- Reducing prime graphs and recognizing circle graphs
- Representation of a finite graph by a set of intervals on the real line
- Strong tree-cographs are Birkhoff graphs
- Structure theorems for some circular-arc graphs
- The Complexity of Coloring Circular Arcs and Chords
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- The structure of claw-free graphs
- Transitiv orientierbare Graphen
- Tree loop graphs
- Two remarks on circular arc graphs
- Unimodularity and circle graphs
Cited in
(23)- Partial characterizations of 1-perfectly orientable graphs
- Essential obstacles to Helly circular-arc graphs
- 2-nested matrices: towards understanding the structure of circle graphs
- The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw
- Literature reviews in operations research: a new taxonomy and a meta review
- Small \(4\)-regular planar graphs that are not circle representable
- Partial Characterizations of Circular-Arc Graphs
- Treewidth, Circle Graphs, and Circular Drawings
- Treewidth, circle graphs and circular drawings
- On circular-perfect graphs: a survey
- On superperfection of edge intersection graphs of paths
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
- New formulation for coloring circle graphs
- Bipartite complements of circle graphs
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
- Partial characterizations of circular-arc graphs
- A linear-time algorithm for clique-coloring problem in circular-arc graphs
- On non-superperfection of edge intersection graphs of paths
- Circular-arc hypergraphs: rigidity via connectedness
- Forbidden induced subgraph characterization of circle graphs within split graphs
- A polynomial kernel for proper Helly circular-arc vertex deletion
- Leaf sector covers with applications on circle graphs
This page was built for publication: Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448877)
