OpenAlex
PricingAboutJobs
Log inGet started
Work

Independence Number and Maximal Chromatic Polynomials of Connected Graphs

HTML

Year: 2024
Type: article
Source: Graphs and Combinatorics
DOI: 10.1007/s00373-024-02824-2
Authors: Shude Long, Junliang Cai
Institutions: Chongqing University of Arts and Sciences, Beijing Normal University
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences

Open Access status: closed

Funders: National Natural Science Foundation of China, Chongqing University of Arts and Sciences, Chongqing Municipal Education Commission
Awards: 曲面嵌入图中的相关问题研究, G3714371588, G412777886
OpenAlex ID: W4401397802
FWCI:
Cites: 17
Cited by:
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms