Pages that link to "Item:Q1893180"
From MaRDI portal
The following pages link to Every tree contains a large induced subgraph with all degrees odd (Q1893180):
Displaying 12 items.
- On induced subgraphs of trees, with restricted degrees (Q1322256) (← links)
- All trees contain a large induced subgraph having all degrees 1 (mod \(k\)) (Q1377743) (← links)
- On degrees of vertices in paradoxical trees (Q1970576) (← links)
- Induced subgraphs of a tree with constraint degree (Q2101934) (← links)
- Every graph contains a linearly sized induced subgraph with all degrees odd (Q2161306) (← links)
- Odd induced subgraphs in graphs with treewidth at most two (Q2413620) (← links)
- Odd induced subgraphs in planar graphs with large girth (Q2672043) (← links)
- Note on Perfect Forests (Q3188659) (← links)
- Large induced subgraph with restricted degrees in trees (Q5143670) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- On induced subgraphs with all degree odd (Q5952391) (← links)
- Maximum odd induced subgraph of a graph concerning its chromatic number (Q6642508) (← links)