Abstract
Total Chromatic Number of Graphs of Order 2<i>n</i> + l having Maximum Degree 2<i>n</i> − 1
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
https://doi.org/10.1112/jlms/52.3.434
Copy DOIPublication Date: Dec 1, 1995 | |
Citations: 4 |
Total Chromatic Number of Graphs of Order 2<i>n</i> + l having Maximum Degree 2<i>n</i> − 1
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.