OpenAlex
PricingAboutJobs
Log inGet started
Work

Counting H-colorings of partial k-trees

HTML

Year: 2002
Type: article
Source: Theoretical Computer Science
DOI: 10.1016/s0304-3975(02)00017-8
Authors: Josep Díaz, Maria Serna, Dimitrios M. Thilikos
Institution: Universitat Politècnica de Catalunya
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: H-coloring, partial k-trees, k-trees, linear-time algorithms, #P-completeness, directed graphs, graph coloring

Open Access status: bronze
OpenAlex ID: W2005253487
FWCI: 1.102
Cites: 51
Cited by: 75
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security