Spanning \(k\)-trees of bipartite graphs

zbMath1305.05046MaRDI QIDQ490315

Kazuhiro Suzuki, Mikio Kano, Kenta Ozeki, Tomoki Yamashita, Masao Tsugaki

Publication date: 22 January 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p13

zbMATH Keywords

bipartite graphspanning treespanning \(k\)-tree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Plane bichromatic trees of low degree ⋮ Maximum properly colored trees in edge-colored graphs ⋮ Rainbow and properly colored spanning trees in edge-colored bipartite graphs

Cites Work

• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning trees: A survey
• On a \(k\)-tree containing specified leaves in a graph
• Spanning trees with bounded degrees
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• On Hamiltonian bipartite graphs
• Spanning trees of bounded degree

This page was built for publication: Spanning \(k\)-trees of bipartite graphs