The LBFS Structure and Recognition of Interval Graphs

From MaRDI portal
Revision as of 21:46, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3058537

DOI10.1137/S0895480100373455zbMath1207.05131OpenAlexW1998389851MaRDI QIDQ3058537

Stephan Olariu, Lorna K. Stewart, Derek Gordon Corneil

Publication date: 3 December 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100373455




Related Items (44)

Recognizing graph search treesComputing the clique-separator graph for an interval graph in linear timeHappy set problem on subclasses of co-comparability graphsThe LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability GraphsA new LBFS-based algorithm for cocomparability graph recognitionGraph searches and their end verticesRobinsonian matrices: recognition challengesHomothetic polygons and beyond: maximal cliques in intersection graphsExtending partial representations of interval graphsVertex Ordering Characterizations of Graphs of Bounded Asteroidal NumberRecognizing simple-triangle graphs by restricted 2-chain subgraph coverChronological rectangle digraphs which are two-terminal series-parallelRecognition and characterization of chronological interval digraphsLinearizing partial search ordersInterval scheduling and colorful independent setsSimilarity-First Search: A New Algorithm with Application to Robinsonian Matrix RecognitionRecognizing interval bigraphs by forbidden patternsA tie-break model for graph searchInterval graphs, adjusted interval digraphs, and reflexive list homomorphismsA Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval GraphsUnnamed ItemUnnamed ItemUnit and single point interval graphsA new graph parameter to measure linearityMin-Orderable DigraphsInterval graph representation with given interval and intersection lengthsMinimal obstructions for partial representations of interval graphsStrict chordal and strict split digraphsNon-edge orientation and vertex ordering characterizations of some classes of bigraphsExtending partial representations of proper and unit interval graphsEnd-vertices of LBFS of (AT-free) bigraphsStar Partitions of Perfect GraphsHappy set problem on subclasses of co-comparability graphsIntersection graphs of non-crossing pathsRecognition and drawing of stick graphsOn the Power of Graph Searching for Cocomparability GraphsOn rectangle intersection graphs with stab number at most twoOn the stab number of rectangle intersection graphsThe Recognition Problem of Graph Search TreesInductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a reviewGraph Classes and Forbidden Patterns on Three VerticesUniquely Restricted Matchings in Interval GraphsA simple optimal algorithm for \(k\)-tuple dominating problem in interval graphsExtending partial representations of subclasses of chordal graphs




This page was built for publication: The LBFS Structure and Recognition of Interval Graphs