scientific article; zbMATH DE number 6312068
From MaRDI portal
Publication:5167721
zbMath1294.05149MaRDI QIDQ5167721
Publication date: 1 July 2014
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2066/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
chordal graphinterval graphrecognition algorithminterval representationlexicographic breadth-first searchperfect ordering
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (7)
The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs ⋮ Graph searches and their end vertices ⋮ A simple linear time algorithm to solve the MIST problem on interval graphs ⋮ Robinsonian matrices: recognition challenges ⋮ A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs ⋮ A five-element transformation monoid on labelled trees ⋮ Graph Classes and Forbidden Patterns on Three Vertices
This page was built for publication: