Bounds on the leaf number in graphs of girth 4 or 5
From MaRDI portal
Publication:5035782
DOI10.1080/09720529.2020.1766761zbMath1483.05055OpenAlexW3037179965MaRDI QIDQ5035782
Publication date: 22 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2020.1766761
Related Items (4)
Radius, leaf number, connected domination number and minimum degree ⋮ Average distance and connected domination ⋮ Degree Distance in Graphs with Forbidden Subgraphs ⋮ A note on connected domination number and leaf number
Cites Work
- Unnamed Item
- Unnamed Item
- On minimum degree, leaf number, traceability and Hamiltonicity in graphs
- Spanning trees: A survey
- Arbres avec un nombre maximum de sommets pendants
- Spanning trees with many leaves and average distance
- Constructing full spanning trees for cubic graphs
- Spanning trees in graphs of minimum degree 4 or 5
- Minimal spanning trees with a constraint on the number of leaves
- Claw-free graphs---a survey
- Hamiltonicity, minimum degree and leaf number
- Leaf number and Hamiltonian \(C_4\)-free graphs
- Spanning paths in graphs
- Transversal numbers of uniform hypergraphs
- On spanning cycles, paths and trees
- Spanning trees with many leaves in cubic graphs
- Spanning Trees with Many Leaves
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- Connected Domination and Spanning Trees with Many Leaves
- Minimum Degree, Leaf Number, and Hamiltonicity
- Spanning paths and cycles in triangle-free graphs
- Lower bounds on the leaf number in graphs with forbidden subgraphs
- Spanning trees with many leaves
This page was built for publication: Bounds on the leaf number in graphs of girth 4 or 5
