Semi-proper interval graphs
From MaRDI portal
Publication:6648246
DOI10.1016/j.dam.2024.08.016MaRDI QIDQ6648246
Publication date: 4 December 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new LBFS-based algorithm for cocomparability graph recognition
- On counting interval lengths of interval graphs
- The longest path problem has a polynomial solution on interval graphs
- Mixed unit interval graphs
- Some aspects of perfect elimination orderings in chordal graphs
- Chronological orderings of interval graphs
- A tie-break model for graph search
- An optimal greedy heuristic to color interval graphs
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
- Finding Hamiltonian circuits in proper interval graphs
- Open-interval graphs versus closed-interval graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- On a class of posets and the corresponding comparability graphs
- 1-tough cocomparability graphs are hamiltonian
- Proper interval graphs and the guard problem
- PC trees and circular-ones arrangements.
- On the classes of interval graphs of limited nesting and count of lengths
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Algorithmic graph theory and perfect graphs
- Optimal labelling of unit interval graphs
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- Graphs of interval count two with a given partition
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- The longest cycle problem is polynomial on interval graphs
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
- Optimal greedy algorithms for indifference graphs
- Incidence matrices and interval graphs
- LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
- Computing Minimum Geodetic Sets of Proper Interval Graphs
- Completion of the Mixed Unit Interval Graphs Hierarchy
- A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs
- The LBFS Structure and Recognition of Interval Graphs
- A Unified View of Graph Searching
- The Interval Count of a Graph
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Graph Classes: A Survey
- Unit Interval Graphs of Open and Closed Intervals
- Maximal Neighborhood Search and Rigid Interval Graphs
- Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs
- Graph-Theoretic Concepts in Computer Science
- A Characterization of Comparability Graphs and of Interval Graphs
- Optimal Linear Arrangement of Interval Graphs
- Complexity of maximum cut on interval graphs
- Recognizing (unit) interval graphs by zigzag graph searches
- Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)
Related Items (1)
This page was built for publication: Semi-proper interval graphs