Decomposing a graph into two subgraphs with prescribed parities of vertex degrees

zbMATH Open1431.05124MaRDI QIDQ2286313FDOQ2286313

Authors: Mirko Petruševski, Riste Škrekovski 

Publication date: 22 January 2020

Published in: Advances in Mathematics. Scientific Journal (Search for Journal in Brave)

Full work available at URL: http://research-publication.com/wp-content/uploads/2019/08/AMSJ-2019-N2-1.pdf

Recommendations

• Decomposition of a graph into two disjoint odd subgraphs
• Decomposition of bipartite graphs into special subgraphs
• scientific article; zbMATH DE number 3841905
• Partitioning a graph into degenerate subgraphs
• Graph decomposition and parity
• Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
• scientific article; zbMATH DE number 944226
• Decomposition of bipartite graphs under degree constraints
• Decompositions of complete graphs into bipartite 2-regular subgraphs
• scientific article; zbMATH DE number 4196017

zbMATH Keywords

edge coloringfour-node network modelparity decompositionparity vector-function

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 (3)

• Decomposition of a graph into two disjoint odd subgraphs
• Odd decompositions and coverings of graphs
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications

This page was built for publication: Decomposing a graph into two subgraphs with prescribed parities of vertex degrees

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