On a k-tree containing specified leaves in a graph

DOI10.1007/S00373-006-0660-5zbMATH Open1108.05028OpenAlexW2026543816MaRDI QIDQ855299FDOQ855299

Haruhide Matsuda, Hajime Matsumura

Publication date: 5 January 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0660-5

zbMATH Keywords

Independence numberTreeSpanning subgraphFactorOre

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Title not available (Why is that?)
• Note on Hamilton Circuits
• Spanning trees with bounded degrees
• On Representatives of Subsets
• Hamilton connected graphs
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen

Cited In (14)

• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• Spanning trees with bounded degrees and leaves
• On unavoidability of trees with \(k\) leaves
• Spanning trees: A survey
• A \(k\)-tree containing specified vertices
• On a spanning \(K\)-tree containing specified vertices in a graph
• Chvátal–Erdős Theorem: Old Theorem with New Aspects
• Spanning \(k\)-trees of bipartite graphs
• Spanning \(k\)-trees of \(n\)-connected graphs
• The independence number condition for the existence of a spanning f-tree
• The existence of \(f\)-forests and \(f\)-trees in graphs
• On spanning trees with few branch vertices
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning k-tree with specified vertices

This page was built for publication: On a \(k\)-tree containing specified leaves in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855299)