Semi-proper interval graphs
From MaRDI portal
Recommendations
Cites work
- 1-tough cocomparability graphs are hamiltonian
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- A Characterization of Comparability Graphs and of Interval Graphs
- A four-sweep LBFS recognition algorithm for interval graphs
- A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs
- A new LBFS-based algorithm for cocomparability graph recognition
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- A tie-break model for graph search
- A Unified View of Graph Searching
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- An optimal greedy heuristic to color interval graphs
- Chronological orderings of interval graphs
- Complexity of maximum cut on interval graphs
- Computing minimum geodetic sets of proper interval graphs
- Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)
- Finding Hamiltonian circuits in proper interval graphs
- Graph Classes: A Survey
- Graph-Theoretic Concepts in Computer Science
- Graphs of interval count two with a given partition
- scientific article; zbMATH DE number 3172312 (Why is no real title available?)
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 1375584 (Why is no real title available?)
- scientific article; zbMATH DE number 176590 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 7651152 (Why is no real title available?)
- scientific article; zbMATH DE number 7765365 (Why is no real title available?)
- Incidence matrices and interval graphs
- LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
- Maximal label search algorithms to compute perfect and minimal elimination orderings
- Maximal neighborhood search and rigid interval graphs
- Mixed unit interval graphs
- On a class of posets and the corresponding comparability graphs
- On counting interval lengths of interval graphs
- On the classes of interval graphs of limited nesting and count of lengths
- On the end-vertex problem of graph searches
- Open-interval graphs versus closed-interval graphs
- Optimal greedy algorithms for indifference graphs
- Optimal labelling of unit interval graphs
- Optimal Linear Arrangement of Interval Graphs
- PC trees and circular-ones arrangements.
- Proper interval graphs and the guard problem
- Recognizing (unit) interval graphs by zigzag graph searches
- Some aspects of perfect elimination orderings in chordal graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- The Interval Count of a Graph
- The LBFS structure and recognition of interval graphs
- The longest cycle problem is polynomial on interval graphs
- The longest path problem has a polynomial solution on interval graphs
- Unit interval graphs of open and closed intervals
This page was built for publication: Semi-proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648246)
