Normal Helly circular-arc graphs and its subclasses
From MaRDI portal
Recommendations
- Proper Helly Circular-Arc Graphs
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Linear-time recognition of Helly circular-arc models and graphs
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
- Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time
Cites work
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 1554938 (Why is no real title available?)
- scientific article; zbMATH DE number 2188345 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- A simpler linear-time recognition of circular-arc graphs
- Algorithmic graph theory and perfect graphs
- Algorithms on circular-arc graphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Boxicity of circular arc graphs
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Clique graphs of time graphs
- Coloring a Family of Circular Arcs
- Consecutive retrieval property -- revisited
- From a Circular-Arc Model to a Proper Circular-Arc Model
- Fully dynamic representations of interval graphs
- Incidence matrices and interval graphs
- Interval bigraphs and circular arc graphs
- Interval graphs and interval orders
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
- Linear-Time Representation Algorithms for 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
- On cliques of Helly Circular-arc Graphs
- On the structure of local tournaments
- PC trees and circular-ones arrangements.
- Proper Helly Circular-Arc Graphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Representation of a finite graph by a set of intervals on the real line
- Restricted circular-arc graphs and clique cycles
- Short models for unit interval graphs
- Simple linear time recognition of unit interval graphs
- Structure theorems for some circular-arc graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Roberts characterization of proper and unit interval graphs
- The clique operator on circular-arc graphs
- Unit Circular-Arc Graph Representations and Feasible Circulations
Cited in
(21)- scientific article; zbMATH DE number 1990726 (Why is no real title available?)
- scientific article; zbMATH DE number 2188345 (Why is no real title available?)
- Characterization of 2-path signed network
- Linear-time recognition of Helly circular-arc models and graphs
- Fully dynamic recognition of proper circular-arc graphs
- Proper Helly Circular-Arc Graphs
- Completing colored graphs to meet a target property
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
- On some subclasses of circular-arc graphs
- Dual parameterization of weighted coloring
- Essential obstacles to Helly circular-arc graphs
- 2-nested matrices: towards understanding the structure of circle graphs
- Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
- On neighborhood-Helly graphs
- Parameterized complexity of induced graph matching on claw-free 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
- Modification problems toward proper (Helly) circular-arc graphs
- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
- Extending partial representations of circular-arc graphs
- A polynomial kernel for proper Helly circular-arc vertex deletion
This page was built for publication: Normal Helly circular-arc graphs and its subclasses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949109)
