On trees with a maximum proper partial 0-1 coloring containing a maximum matching
classification
💻 cs.DM
keywords
maximumcoloringmatchingpartialpropercoloredcontainingdistance
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.