Large induced degenerate subgraphs

From MaRDI portal
Publication:1092059

DOI10.1007/BF01788542zbMath0624.05039MaRDI QIDQ1092059

P. D. Seymour, Jeffry Kahn, Noga Alon

Publication date: 1987

Published in: Graphs and Combinatorics (Search for Journal in Brave)




Related Items

The size of graphs with given feedback vertex number, On Subgraphs of Bounded Degeneracy in Hypergraphs, Maximum induced forests of planar graphs, A note on a Caro-Wei bound for the bipartite independence number in graphs, 3‐Degenerate induced subgraph of a planar graph, Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives, New ordering methods to construct contagious sets and induced degenerate subgraphs, The high order spectrum of a graph and its applications in graph colouring and clique counting, Induced forests in some distance-regular graphs, New bounds for contagious sets, Linear-programming design and analysis of fast algorithms for Max 2-CSP, Degenerate matchings and edge colorings, New exact algorithms for the 2-constraint satisfaction problem, Problems and results in extremal combinatorics. I., Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs, Maximum 4-degenerate subgraph of a planar graph, Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph, Recoverable Values for Independent Sets, Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees, Acyclic polynomials of graphs, Induced 2-degenerate subgraphs of triangle-free planar graphs, PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA, Bounding the feedback vertex number of digraphs in terms of vertex degrees, Remarks on dynamic monopolies with given average thresholds, Partitioning a graph into degenerate subgraphs, Large induced forests in sparse graphs, Feedback vertex sets in cubic multigraphs, Large Induced Forests in Graphs, The integrity of a cubic graph, Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees



Cites Work