scientific article; zbMATH DE number 1303554

zbMath0930.68105MaRDI QIDQ4250178

Stephan Olariu, Derek Gordon Corneil, Lorna K. Stewart

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

asteroidal triple

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (32)

Approximate L(δ₁,δ₂,…,δ_t)‐coloring of trees and interval graphs ⋮ Can transitive orientation make sandwich problems easier? ⋮ Separation dimension of graphs and hypergraphs ⋮ Recognizing and representing proper interval graphs in parallel using merging and sorting ⋮ Recognizing graphs without asteroidal triples ⋮ A Characterization of Mixed Unit Interval Graphs ⋮ Characterizing interval graphs which are probe unit interval graphs ⋮ Recognizing interval bigraphs by forbidden patterns ⋮ An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs ⋮ A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs ⋮ A characterization of unit interval bigraphs of open and closed intervals ⋮ Integral mixed unit interval graphs ⋮ Fully dynamic representations of interval graphs ⋮ A fully dynamic graph algorithm for recognizing interval graphs ⋮ New results on induced matchings ⋮ Unit Interval Graphs of Open and Closed Intervals ⋮ A structural characterization for certifying Robinsonian matrices ⋮ A matrix characterization of interval and proper interval graphs ⋮ On end-vertices of lexicographic breadth first searches ⋮ Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs ⋮ Unnamed Item ⋮ A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs ⋮ Mixed unit interval graphs ⋮ Fast algorithms for identifying maximal common connected sets of interval graphs ⋮ A simple algorithm to find Hamiltonian cycles in proper interval graphs ⋮ A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs ⋮ A Lex-BFS-based recognition algorithm for Robinsonian matrices ⋮ On compact and efficient routing in certain graph classes ⋮ The clique-separator graph for chordal graphs ⋮ Weighted sum coloring in batch scheduling of conflicting jobs ⋮ A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs ⋮ A polynomial algorithm for the k-cluster problem on the interval graphs

This page was built for publication: