Every tree contains a large induced subgraph with all degrees odd

DOI10.1016/0012-365X(93)E0186-8zbMath0822.05022OpenAlexW2023006192MaRDI QIDQ1893180

Andrew John Radcliffe, Alexander D. Scott

Publication date: 28 September 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0186-8

zbMATH Keywords

treeboundinduced subgraph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (6)

Note on Perfect Forests ⋮ All trees contain a large induced subgraph having all degrees 1 (mod \(k\)) ⋮ Odd induced subgraphs in graphs with treewidth at most two ⋮ Odd induced subgraphs in planar graphs with large girth ⋮ On the complexity of finding large odd induced subgraphs and odd colorings ⋮ Induced subgraphs of a tree with constraint degree

Cites Work

• Unnamed Item
• Unnamed Item
• On induced subgraphs of trees, with restricted degrees
• On induced subgraphs with odd degrees
• Large Induced Subgraphs with All Degrees Odd

This page was built for publication: Every tree contains a large induced subgraph with all degrees odd