A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs

DOI10.7155/jgaa.00123zbMath1161.68648OpenAlexW2143613789MaRDI QIDQ5301387

Grant A. Cheston, Tjoen Seng Jap

Publication date: 19 January 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55398

zbMATH Keywords

Efficient algorithms

Mathematics Subject Classification ID

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

Related Items (8)

On strict-double-bound numbers of caterpillars ⋮ On strict-double-bound numbers of graphs and cut sets ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Equistable simplicial, very well-covered, and line graphs ⋮ On local maximum stable set greedoids ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ Strong cliques in diamond-free graphs ⋮ 1-Triangle graphs and perfect neighborhood sets

This page was built for publication: A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs