Induced subgraphs of a tree with constraint degree

DOI10.1016/J.AMC.2022.127657OpenAlexW4308345978MaRDI QIDQ2101934

Baoyindureng Wu, Tao Wang

Publication date: 7 December 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127657

zbMATH Keywords

induced subgraphsdegreesodd subgraphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced cycles in graphs
• On induced subgraphs of trees, with restricted degrees
• All trees contain a large induced subgraph having all degrees 1 (mod \(k\))
• Every tree contains a large induced subgraph with all degrees odd
• Odd induced subgraphs in graphs with treewidth at most two
• Odd induced subgraphs in planar graphs with large girth
• Note on Perfect Forests
• Large Induced Subgraphs with All Degrees Odd
• On the complexity of finding large odd induced subgraphs and odd colorings
• On induced subgraphs with all degree odd

This page was built for publication: Induced subgraphs of a tree with constraint degree