On induced subgraphs with odd degrees
From MaRDI portal
Publication:1336646
DOI10.1016/0012-365X(92)00563-7zbMath0808.05090MaRDI QIDQ1336646
Publication date: 9 March 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (12)
Every tree contains a large induced subgraph with all degrees odd ⋮ Note on Perfect Forests ⋮ Every graph contains a linearly sized induced subgraph with all degrees odd ⋮ Zero-sum problems -- a survey ⋮ 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 subgraphs with degrees of prescribed residues in the random graph ⋮ Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions ⋮ A result on large induced subgraphs with prescribed residues in bipartite graphs ⋮ On the complexity of finding large odd induced subgraphs and odd colorings ⋮ On induced subgraphs of trees, with restricted degrees
Cites Work
This page was built for publication: On induced subgraphs with odd degrees
