Large Induced Subgraphs with All Degrees Odd
From MaRDI portal
(Redirected from Publication:4291193)
Recommendations
Cited in
(23)- On induced subgraphs with odd 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
- Induced subgraphs of a tree with constraint degree
- Every graph contains a linearly sized 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
- Distinct degrees and homogeneous sets
- A result on large induced subgraphs with prescribed residues in bipartite graphs
- Large induced subgraphs with three repeated degrees
- Isolating highly connected induced subgraphs
- Note on Perfect Forests
- scientific article; zbMATH DE number 1051278 (Why is no real title available?)
- On the complexity of finding large odd induced subgraphs and odd colorings
- On induced subgraphs with all degree odd
- 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
- Unavoidable Induced Subgraphs of Large 2-Connected Graphs
- Maximum odd induced subgraph of a graph concerning its chromatic number
- Vertex partitioning of graphs into odd induced subgraphs
- Graphs whose the maximum size of an odd subgraph equal to \(\lfloor \frac{n}{2} \rfloor \)
- On modular edge colorings of graphs
- Large induced subgraphs with equated maximum degree
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)
