Parity and disparity subgraphs
From MaRDI portal
Publication:1025535
DOI10.1016/j.disc.2008.03.028zbMath1209.05187MaRDI QIDQ1025535
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.03.028
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Even poset and a parity result for binary linear code
- A note on odd and even factors of undirected graphs
- Generalizations of line graphs and applications
- Counting maximal cycles in binary matroids
- A proof of McKee's Eulerian-bipartite characterization
- Characterizations of postman sets
- Parity Subgraph, Shortest Cycle Cover, and Postman Tour
- A reduction method to find spanning Eulerian subgraphs
- Adjacency on the Postman Polyhedron
- On the Number of Parity Sets in a Graph