Two remarks on circular arc graphs
From MaRDI portal
Publication:675889
DOI10.1007/BF01202237zbMATH Open0868.05043OpenAlexW2042309505MaRDI QIDQ675889FDOQ675889
Publication date: 18 August 1997
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01202237
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Algorithms on circular-arc graphs
- $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
- Transitiv orientierbare Graphen
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- List homomorphisms and circular arc graphs
- Coloring a Family of Circular Arcs
- Matrix characterizations of circular-arc graphs
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
- Circular-arc graphs with clique cover number two
- An Efficient Test for Circular-Arc Graphs
- Title not available (Why is that?)
- Finding maximum cliques on circular-arc graphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
Cited In (15)
- Representation characterizations of chordal bipartite graphs
- A generalization of the theorem of Lekkerkerker and Boland
- Graphs and digraphs represented by intervals and circular arcs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Obstacle numbers of graphs
- The restricted arc-width of a graph
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Lexicographic Orientation Algorithms
- Ferrers dimension of grid intersection graphs
- Circular‐arc digraphs: A characterization
- On orthogonal ray trees
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Partial Characterizations of 1‐Perfectly Orientable Graphs
- Circular‐Arc Bigraphs and Its Subclasses
This page was built for publication: Two remarks on circular arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675889)
