Combinatorial optimization with 2-joins
Authors:
- Nicolas TrotignonNTNicolas Trotignon
- Kristina VuškovićKVKristina Vušković
- 1 January 2012
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 102 (1) , 153-185
Abstract
No abstract availableKeywords
All Related Versions
This publication has 29 references indexed in Scilit:
- A structure theorem for graphs with no cycle with a unique chord and its consequencesJournal of Graph Theory, 2009
- Berge trigraphsJournal of Graph Theory, 2006
- Graph minor theoryBulletin of the American Mathematical Society, 2005
- Recognizing Berge GraphsCombinatorica, 2005
- Even‐hole‐free graphs part II: Recognition algorithmJournal of Graph Theory, 2002
- Even‐hole‐free graphs part I: Decomposition theoremJournal of Graph Theory, 2001
- Coloring precolored perfect graphsJournal of Graph Theory, 1997
- Bull-free Berge graphs are perfectGraphs and Combinatorics, 1987
- An Optimal Algorithm to Detect a Line Graph and Output Its Root GraphJournal of the ACM, 1974
- A max {m,n} algorithm for determining the graph H from its line graph GInformation Processing Letters, 1973