Maximum acyclic and fragmented sets in regular graphs

DOI10.1002/jgt.20271zbMath1131.05050OpenAlexW4247832516MaRDI QIDQ5441408

Oleg Pikhurko, Penny E. Haxell, Andrew G. Thomason

Publication date: 13 February 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20271

zbMATH Keywords

random regular graphsdecycling numberfragmentabilityconnectivity components

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (5)

Optimal segmentation of directed graph and the minimum number of feedback arcs ⋮ Planarization and fragmentability of some classes of graphs ⋮ A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP ⋮ Deciding Relaxed Two-Colourability: A Hardness Jump ⋮ Minimal contagious sets in random regular graphs

This page was built for publication: Maximum acyclic and fragmented sets in regular graphs