Odd decompositions and coverings of graphs
From MaRDI portal
Publication:2225430
Recommendations
Cites work
- A Class Of Abelian Groups
- A Contribution to the Theory of Chromatic Polynomials
- Chromatic graph theory
- Coverability of graph by three odd subgraphs
- Covering the edges of a graph by three odd subgraphs
- Decomposing a graph into two subgraphs with prescribed parities of vertex degrees
- Decomposition of a graph into two disjoint odd subgraphs
- Flows and generalized coloring theorems in graphs
- Graph theory
- Graph theory
- scientific article; zbMATH DE number 426361 (Why is no real title available?)
- scientific article; zbMATH DE number 3508211 (Why is no real title available?)
- scientific article; zbMATH DE number 978847 (Why is no real title available?)
- Minimum partition of a matroid into independent subsets
- Odd 4-edge-colorability of graphs
- Odd edge coloring of graphs
- Odd edge-colorability of subcubic graphs
- On the eulericity of a graph
Cited in
(12)- Decomposition of a graph into two disjoint odd subgraphs
- Remarks on proper conflict-free colorings of graphs
- Colorings with neighborhood parity condition
- Remarks on odd colorings of graphs
- Odd length: odd diagrams and descent classes
- Covering the edges of a graph by four odd subgraphs
- scientific article; zbMATH DE number 1237933 (Why is no real title available?)
- Partitions into odd chains
- scientific article; zbMATH DE number 6297711 (Why is no real title available?)
- Covering the edges of a graph by three odd subgraphs
- Odd edge‐colorings of subdivisions of odd graphs
- Odd covers of graphs
This page was built for publication: Odd decompositions and coverings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225430)