Circular-arc graphs with clique cover number two
From MaRDI portal
(Redirected from Publication:1078197)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3825206 (Why is no real title available?)
- Algorithms on circular-arc graphs
- An Efficient Test for Circular-Arc Graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Circular permutation graphs
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- Structure theorems for some circular-arc graphs
Cited in
(17)- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- List-homomorphism problems on graphs and arc consistency
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- A simpler linear-time recognition of circular-arc graphs
- Circular-arc bigraphs and its subclasses
- Representation characterizations of chordal bipartite graphs
- On orthogonal ray trees
- A generalization of the theorem of Lekkerkerker and Boland
- Two‐arc closed subsets of graphs
- Obstacle numbers of graphs
- Two remarks on circular arc graphs
- Lexicographic orientation algorithms
- New characterizations of proper interval bigraphs
- Permutation bigraphs and interval containments
- On orthogonal ray graphs
- Interval \(k\)-graphs and orders
- A note on the Hadwiger number of circular arc graphs
This page was built for publication: Circular-arc graphs with clique cover number two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078197)
