One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
Open Accesshttps://doi.org/10.1016/0095-8956(80)90093-3
Copy DOI
Export
Save
Share
Cite Publication Date: Dec 1, 1980 | |
 Citations: 69 |  License type: elsevier-specific: oa user license |
Affiliation: Smith College
For each n, we obtain a (polynomial) bound on the chromatic number in terms of the maximum size of a complete subgraph, for graphs not having n · K 2 as an induced subgraph.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
