All trees contain a large induced subgraph having all degrees 1 (mod \(k\))

DOI10.1016/S0012-365X(96)00283-XzbMath0896.05015OpenAlexW2024256478MaRDI QIDQ1377743

Hong Wang, David M. Berman, Larry Wargo, Alexander D. Scott, Andrew John Radcliffe

Publication date: 6 July 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00283-x

zbMATH Keywords

treesubgraph enumeration

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (2)

Odd induced subgraphs in planar graphs with large girth ⋮ Induced subgraphs of a tree with constraint degree

Cites Work

• Unnamed Item
• On induced subgraphs of trees, with restricted degrees
• On induced subgraphs with odd degrees
• Every tree contains a large induced subgraph with all degrees odd
• Large Induced Subgraphs with All Degrees Odd

This page was built for publication: All trees contain a large induced subgraph having all degrees 1 (mod \(k\))