The following pages link to Maximum induced trees in graphs (Q1082351):
Displayed 41 items.
- Lower and upper bounds for long induced paths in 3-connected planar graphs (Q290522) (← links)
- On the decycling number of generalized Kautz digraphs (Q477628) (← links)
- The decycling number of generalized Petersen graphs (Q479058) (← links)
- Decycling bubble sort graphs (Q494444) (← links)
- Using size for bounding expressions of graph invariants (Q646725) (← links)
- Linearly independent vertices and minimum semidefinite rank (Q836992) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (Q955318) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- Feedback numbers of de Bruijn digraphs (Q980262) (← links)
- Nordhaus-Gaddum relations for proximity and remoteness in graphs (Q988253) (← links)
- Minimum size of a graph or digraph of given radius (Q989544) (← links)
- Large induced trees in \(K_r\)-free graphs (Q1003853) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← links)
- On \(m\)-centers in \(P_ t\)-free graphs (Q1322266) (← links)
- New formulae for the decycling number of graphs (Q1630929) (← links)
- Leaf realization problem, caterpillar graphs and prefix normal words (Q1637224) (← links)
- Graph spectra (Q1916101) (← links)
- A characterization of graphs where the independence number equals the radius (Q1926039) (← links)
- Wiener index of graphs with radius two (Q1952734) (← links)
- The decycling number of outerplanar graphs (Q1956257) (← links)
- On the minimum semidefinite rank of signed graphs (Q2133675) (← links)
- Concatenating bipartite graphs (Q2144334) (← links)
- Possible cardinalities of the center of a graph (Q2238997) (← links)
- Tree-core and tree-coritivity of graphs (Q2348704) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- Decycling with a matching (Q2628271) (← links)
- On the minimum semidefinite rank of a simple graph (Q3006563) (← links)
- Feedback vertex number of Sierpiński-type graphs (Q3299375) (← links)
- Induced Forests in Regular Graphs with Large Girth (Q3545905) (← links)
- New bounds on the decycling number of generalized de Bruijn digraphs (Q4595251) (← links)
- Large Induced Forests in Graphs (Q4978444) (← links)
- On the nullity number of graphs (Q5006628) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- (Q5708559) (← links)
- Induced trees in triangle-free graphs (Q5900077) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Domination number and feedback vertex number of complements of line graphs (Q6101458) (← links)
- Radius, leaf number, connected domination number and minimum degree (Q6110370) (← links)
- Induced forests in some distance-regular graphs (Q6153467) (← links)