On large odd induced subgraphs of graphs
From MaRDI portal
Cites work
- Every graph contains a linearly sized induced subgraph with all degrees odd
- Every tree contains a large induced subgraph with all degrees odd
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 1051278 (Why is no real title available?)
- Large induced subgraph with restricted degrees in trees
- Large Induced Subgraphs with All Degrees Odd
- Maximum odd induced subgraph of a graph concerning its chromatic number
- Odd chromatic number of graph classes
- Odd induced subgraphs in graphs with treewidth at most two
- Odd induced subgraphs in planar graphs with large girth
- On induced subgraphs of trees, with restricted degrees
- On induced subgraphs with all degree odd
- On induced subgraphs with odd degrees
- Vertex partitioning of graphs into odd induced subgraphs
This page was built for publication: On large odd induced subgraphs of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446375)