Graphs with homeomorphically irreducible spanning trees
From MaRDI portal
Recommendations
Cited in
(38)- On the \(r\)-domination number of a graph
- NP-completeness and degree restricted spanning trees
- Decomposing graphs into a spanning tree, an even graph, and a star forest
- Snarks with special spanning trees
- Otter's method and the homology of homeomorphically irreducible \(k\)-trees
- Achromatic number and facial achromatic number of connected locally-connected graphs
- Superposition of snarks revisited
- Decompositions of cubic traceable graphs
- Homeomorphically irreducible spanning trees in hexangulations of surfaces
- Cycle double covers and non-separating cycles
- Spanning trees without adjacent vertices of degree 2
- \(\{0, 2 \}\)-degree free spanning forests in graphs
- A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree
- Rooted HIST property on planar triangulations.
- Homeomorphically irreducible spanning trees in locally connected graphs
- Forbidden subgraphs and the existence of a spanning tree without small degree stems
- On homeomorphically irreducible spanning trees in cubic graphs
- Plane graphs without homeomorphically irreducible spanning trees.
- Homeomorphically irreducible spanning trees
- scientific article; zbMATH DE number 861413 (Why is no real title available?)
- Robust connectivity of graphs on surfaces
- Large homeomorphically irreducible trees in path-free graphs
- Dirac's condition for spanning Halin subgraphs
- Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász--Plummer Conjecture on Halin Graphs
- Degree sum conditions for the existence of homeomorphically irreducible spanning trees
- Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree
- The burning number conjecture is true for trees without degree-2 vertices
- Forbidden subgraphs restricting vertices of degree two in a spanning tree
- On the structure of a smallest counterexample and a new class verifying the 2-decomposition conjecture
- Refinements of degree conditions for the existence of a spanning tree without small degree stems
- The number of odd spanning trees in the complete graphs
- A neighborhood union condition for the existence of a spanning tree without degree 2 vertices
- A new strategy for finding spanning trees without small degree stems
- Spanning trees for many different numbers of leaves
- Hoffmann-Ostenhof's 3-decomposition conjecture
- Spectral radius and homeomorphically irreducible spanning trees of graphs
- Degree sum condition for bipartite graph to have homeomorphically irreducible spanning trees
- Decomposing plane cubic graphs
This page was built for publication: Graphs with homeomorphically irreducible spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713007)
