Maximum induced trees in graphs
From MaRDI portal
Publication:1082351
DOI10.1016/0095-8956(86)90028-6zbMath0603.05023OpenAlexW2136253510WikidataQ56388813 ScholiaQ56388813MaRDI QIDQ1082351
Vera T. Sós, Paul Erdős, Michael E. Saks
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/110576/1/1-s2.0-0095895686900286-main.pdf
Related Items
Lower and upper bounds for long induced paths in 3-connected planar graphs, On the minimum semidefinite rank of signed graphs, Linearly independent vertices and minimum semidefinite rank, New formulae for the decycling number of graphs, Decycling with a matching, Leaf realization problem, caterpillar graphs and prefix normal words, Concatenating bipartite graphs, Graph spectra, A new formula for the decycling number of regular graphs, A characterization of graphs where the independence number equals the radius, MIP formulations for induced graph optimization problems: a tutorial, Maximum weighted induced forests and trees: new formulations and a computational comparative review, Exact Solution Algorithms for the Chordless Cycle Problem, Domination number and feedback vertex number of complements of line graphs, New bounds on the decycling number of generalized de Bruijn digraphs, Radius, leaf number, connected domination number and minimum degree, Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited, Induced forests in some distance-regular graphs, Wiener index of graphs with radius two, The decycling number of outerplanar graphs, Using size for bounding expressions of graph invariants, On the decycling number of generalized Kautz digraphs, Induced Forests in Regular Graphs with Large Girth, The decycling number of generalized Petersen graphs, Decycling bubble sort graphs, On the minimum semidefinite rank of a simple graph, Possible cardinalities of the center of a graph, Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number, Induced trees in triangle-free graphs, Infinite versus finite graph domination, Feedback numbers of de Bruijn digraphs, Nordhaus-Gaddum relations for proximity and remoteness in graphs, Minimum size of a graph or digraph of given radius, Large induced trees in \(K_r\)-free graphs, Large Induced Forests in Graphs, Complete description of forbidden subgraphs in the structural domination problem, Unnamed Item, On the nullity number of graphs, Feedback vertex number of Sierpiński-type graphs, Tree-core and tree-coritivity of graphs, On \(m\)-centers in \(P_ t\)-free graphs
Cites Work
