Abstract
This note presents a solution to the following problem posed by Chen, Schelp, and Šoltés: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given. © 1997 John Wiley & Sons, Inc.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
