Covering the edges of a graph by four odd subgraphs

zbMATH Open1348.05165MaRDI QIDQ2829922FDOQ2829922

Authors: Mirko Petruševski 

Publication date: 8 November 2016

Published in: Matematichki Bilten (Search for Journal in Brave)

Full work available at URL: http://im-pmf.weebly.com/uploads/5/8/9/8/58988609/05._15-2.pdf

Recommendations

• Covering the edges of a graph by three odd subgraphs
• Coverability of graph by three odd subgraphs
• Odd decompositions and coverings of graphs
• Covering odd cycles
• Covering weighted graphs by even subgraphs

zbMATH Keywords

edge coverodd subgraphodd edge-coloringShannon triangle

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• Covering the edges of a graph by three odd subgraphs
• Coverability of graph by three odd subgraphs
• Odd decompositions and coverings of graphs
• Covering weighted graphs by even subgraphs
• Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs

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

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