Large Induced Subgraphs with All Degrees Odd
From MaRDI portal
Publication:4291193
DOI10.1017/S0963548300000389zbMATH Open0793.05089OpenAlexW2159873465MaRDI QIDQ4291193FDOQ4291193
Publication date: 5 May 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300000389
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Cited In (18)
- Distinct degrees and homogeneous sets
- Odd induced subgraphs in planar graphs with large girth
- Every tree contains a large induced subgraph with all degrees odd
- Note on Perfect Forests
- Odd induced subgraphs in graphs with treewidth at most two
- Unavoidable Induced Subgraphs of Large 2-Connected Graphs
- Large induced subgraphs with equated maximum degree
- On induced subgraphs with odd degrees
- 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
- Every graph contains a linearly sized induced subgraph with all degrees odd
- Maximum odd induced subgraph of a graph concerning its chromatic number
- Induced subgraphs of a tree with constraint degree
- On the complexity of finding large odd induced subgraphs and odd colorings
- On induced subgraphs with all degree odd
- A result on large induced subgraphs with prescribed residues in bipartite graphs
- Large induced subgraphs with three repeated degrees
- All trees contain a large induced subgraph having all degrees 1 (mod \(k\))
This page was built for publication: Large Induced Subgraphs with All Degrees Odd
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291193)
