Vertex partitioning problems on graphs with bounded tree width
- 1 October 2022
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 319, 254-270
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- The complexity of the matching‐cut problem for planar graphs and other graph classesJournal of Graph Theory, 2009
- On stable cutsets in claw-free graphs and planar graphsJournal of Discrete Algorithms, 2008
- MSOL partitioning problems on graphs of bounded treewidth and clique-widthTheoretical Computer Science, 2007
- Degree-constrained decompositions of graphs: Bounded treewidth and planarityTheoretical Computer Science, 2006
- The complexity of G-free colourabilityDiscrete Mathematics, 1997
- Matching cutsets in graphsJournal of Graph Theory, 1989
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valencyJournal of Graph Theory, 1986
- Recognizing decomposable graphsJournal of Graph Theory, 1984
- Networks immune to isolated line failuresNetworks, 1982
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTSAnnals of the New York Academy of Sciences, 1970