On Induced Subgraphs with All Degrees Odd

@article{Scott2001OnIS,
  title={On Induced Subgraphs with All Degrees Odd},
  author={Alex D. Scott},
  journal={Graphs and Combinatorics},
  year={2001},
  volume={17},
  pages={539-553}
}
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. Note: For the final version of this paper, see the journal… CONTINUE READING