On end-vertices of lexicographic breadth first searches
type: Item
instance of: scholarly article
title: On end-vertices of lexicographic breadth first searches
zbMATH Open document ID: 1225.05229
author: Ekkehard Köhler
author: Jean-Marc Lanlignel
author: Derek G. Corneil
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5703745
zbMATH Keywords: lexicographic breadth first search
zbMATH Keywords: graph algorithm
zbMATH Keywords: complexity
zbMATH Keywords: simplicial vertex
zbMATH Keywords: graph classes
zbMATH Keywords: chordal graphs
zbMATH Keywords: interval graphs
zbMATH Keywords: AT-free graphs
zbMATH Keywords: cocomparability graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2009.10.001
OpenAlex ID: W2086423153
cites work: LexBFS-orderings and powers of chordal graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Diameter determination on restricted graph families
cites work: A Unified View of Graph Searching
cites work: Q4250178
cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
cites work: Almost diameter of a house-hole-free graph in linear time via LexBFS
cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
cites work: Domination on Cocomparability Graphs
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Q4035766
DOI: 10.1016/J.DAM.2009.10.001
description: scientific article; zbMATH DE number 5703745