Maximum induced trees in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Graph Theory and Probability. II
Cited in
(52)- Induced tree covering and the generalized Yutsis property
- Large induced trees in \(K_r\)-free graphs
- Leaf realization problem, caterpillar graphs and prefix normal words
- Wiener index of graphs with radius two
- Using size for bounding expressions of graph invariants
- A characterization of graphs where the independence number equals the radius
- Induced forests in some distance-regular graphs
- Decycling bubble sort graphs
- Concatenating bipartite graphs
- Maximum induced forests of planar graphs
- Finding induced trees
- On maximum induced forests in graphs
- Lower and upper bounds for long induced paths in 3-connected planar graphs
- Induced trees in triangle-free graphs
- New bounds on the decycling number of generalized de Bruijn digraphs
- New formulae for the decycling number of graphs
- Induced trees in triangle-free graphs
- Tree-core and tree-coritivity of graphs
- Schnyder Woods and long induced paths in 3-connected planar graphs
- A new formula for the decycling number of regular graphs
- Graph spectra
- Complete description of forbidden subgraphs in the structural domination problem
- Maximum induced forests in graphs of bounded treewidth
- scientific article; zbMATH DE number 3977047 (Why is no real title available?)
- Feedback numbers of de Bruijn digraphs
- Feedback vertex number of Sierpiński-type graphs
- MIP formulations for induced graph optimization problems: a tutorial
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Decycling with a matching
- Induced Forests in Regular Graphs with Large Girth
- scientific article; zbMATH DE number 2230267 (Why is no real title available?)
- Infinite versus finite graph domination
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- The decycling number of outerplanar graphs
- Linearly independent vertices and minimum semidefinite rank
- Dominating and large induced trees in regular graphs
- Possible cardinalities of the center of a graph
- On the minimum semidefinite rank of a simple graph
- Minimum size of a graph or digraph of given radius
- Large induced forests in graphs
- Domination number and feedback vertex number of complements of line graphs
- On the nullity number of graphs
- Maximal trees with bounded maximum degree in a graph
- On the minimum semidefinite rank of signed graphs
- On the decycling number of generalized Kautz digraphs
- Radius, leaf number, connected domination number and minimum degree
- The decycling number of generalized Petersen graphs
- Exact Solution Algorithms for the Chordless Cycle Problem
- On the maximum orders of an induced forest, an induced tree, and a stable set
- Maximum weighted induced forests and trees: new formulations and a computational comparative review
- On \(m\)-centers in \(P_ t\)-free graphs
This page was built for publication: Maximum induced trees in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082351)
