Abstract.
Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove that every connected graph of even order has a vertex partition into sets inducing subgraphs with all degrees odd, and give bounds for the number of sets of this type required for vertex partitions and vertex covers. We also give results on the partitioning and covering problems for random graphs.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: October 5, 1998¶Final version received: October 20, 2000
Rights and permissions
About this article
Cite this article
Scott, A. On Induced Subgraphs with All Degrees Odd. Graphs Comb 17, 539–553 (2001). https://doi.org/10.1007/s003730170028
Issue Date:
DOI: https://doi.org/10.1007/s003730170028