Fragmentability of graphs
From MaRDI portal
Publication:1850531
DOI10.1006/jctb.2000.2018zbMath1028.05054OpenAlexW2071177062MaRDI QIDQ1850531
Graham E. Farr, Keith J. Edwards
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.2018
Related Items
Percolation with small clusters on random graphs ⋮ A randomized algorithm with local search for containment of pandemic disease spread ⋮ Planarization and fragmentability of some classes of graphs ⋮ Dismantling Sparse Random Graphs ⋮ Achromatic and Harmonious Colorings of Circulant Graphs ⋮ Induced Forests in Regular Graphs with Large Girth ⋮ A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP ⋮ Deciding Relaxed Two-Colourability: A Hardness Jump ⋮ On monochromatic component size for improper colourings ⋮ On the \(k\)-component independence number of a tree ⋮ Research problems from the 18th British Combinatorial Conference
Cites Work
