Covering the edges of a graph by three odd subgraphs

DOI10.1002/JGT.20170MaRDI QIDQ5487779zbMATH OpenOpenAlexFDO

Authors Tamás Mátrai

Publication date 12 September 2006

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20170

zbMATH Keywords

edge covering

Mathematics Subject Classification ID

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

Recommendations

• Coverability of graph by three odd subgraphs
• Covering the edges of a graph by four odd subgraphs
• Odd decompositions and coverings of graphs
• scientific article; zbMATH DE number 5811
• A note about shortest cycle covers

Cites work

• Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices

Cited in

(11)

• Coverability of graph by three odd subgraphs
• An overview of graph covering and partitioning
• Facial parity edge colouring of plane pseudographs
• Unique-maximum edge-colouring of plane graphs with respect to faces
• Odd decompositions and coverings of graphs
• Spanning even subgraphs of 3‐edge‐connected graphs
• Facially-constrained colorings of plane graphs: a survey
• Odd edge‐colorings of subdivisions of odd graphs
• Decomposition of a graph into two disjoint odd subgraphs
• Three ways to cover a graph
• Covering the edges of a graph by four odd subgraphs

This page was built for publication: Covering the edges of a graph by three odd subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487779)