On trees with a maximum proper partial 0-1 coloring containing a maximum matching
arXiv:0707.1926 · doi:10.1016/j.disc.2005.12.019
Abstract
I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum matching.
4 pages
Cited by in corpus (7)
- On disjoint matchings in cubic graphs
- On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs
- On Edge-Disjoint Pairs Of Matchings
- Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings
- Three results towards the approximation of special maximum matchings in graphs
- On BC-trees and BC-subtrees
- On a constructive characterization of a class of trees related to pairs of disjoint matchings