Isolating Highly Connected Induced Subgraphs

DOI10.1137/140981939zbMath1333.05169arXiv1406.1671OpenAlexW3101066016MaRDI QIDQ2801334

Irena Penev, Steéphan Thomassé, Nicolas Trotignon

Publication date: 7 April 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.1671

zbMATH Keywords

connectivitychromatic numberhereditary classes of graphsoperations on graphsextreme decomposition theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Clique cutsets beyond chordal graphs ⋮ Subgraphs of large connectivity and chromatic number ⋮ Highly Connected Subgraphs with Large Chromatic Number

Cites Work

• Unnamed Item
• Substitution and \(\chi\)-boundedness
• Dynamic cage survey
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

This page was built for publication: Isolating Highly Connected Induced Subgraphs