Vertex elimination orderings for hereditary graph classes
Authors:
- Pierre AboulkerPAPierre Aboulker
- Pierre CharbitPCPierre Charbit
- Nicolas TrotignonNTNicolas Trotignon
- Kristina VuškovićKVKristina Vušković
- 1 May 2015
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 338 (5) , 825-834
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja (174033, III44006)
- EGIDE
- Providence Health Care
- Université de Lyon (ANR-11-IDEX-0007)
- Engineering and Physical Sciences Research Council (EP/K016423/1)
- Ministère de l'Europe et des Affaires Étrangères
- Agence Nationale de la Recherche
This publication has 22 references indexed in Scilit:
- Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on ItSIAM Journal on Discrete Mathematics, 2012
- Bisimplicial vertices in even-hole-free graphsJournal of Combinatorial Theory, Series B, 2008
- Claw-free graphs. IV. Decomposition theoremJournal of Combinatorial Theory, Series B, 2008
- The strong perfect graph theoremAnnals of Mathematics, 2006
- Even‐hole‐free graphs part I: Decomposition theoremJournal of Graph Theory, 2001
- Even and odd holes in cap-free graphsJournal of Graph Theory, 1999
- Separability generalizes Dirac's theoremDiscrete Applied Mathematics, 1998
- LexBFS-orderings and powers of chordal graphsDiscrete Mathematics, 1997
- Universally signable graphsCombinatorica, 1997
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961