Decomposition of a graph into two disjoint odd subgraphs

DOI10.1007/s00373-018-1970-0zbMath1402.05175arXiv1802.07991OpenAlexW2963038866WikidataQ129012237 ScholiaQ129012237MaRDI QIDQ1756121

Mikio Kano, Kitti Varga, Gyula Y. Katona

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.07991

zbMATH Keywords

decomposabilityedge decompositionodd factorodd subgraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Colorings with neighborhood parity condition ⋮ Remarks on odd colorings of graphs ⋮ Odd edge‐colorings of subdivisions of odd graphs ⋮ Odd decompositions and coverings of graphs ⋮ Remarks on proper conflict-free colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Odd edge coloring of graphs
• Odd 4‐edge‐colorability of graphs
• Matching, Euler tours and the Chinese postman
• Covering the edges of a graph by three odd subgraphs

This page was built for publication: Decomposition of a graph into two disjoint odd subgraphs