JOURNAL ARTICLE
Total coloring of snarks is NP-complete
Vinícius F. dos SantosDiana Sasaki
Year: 2015 Journal: Matemática Contemporânea Vol: 44 (6) Publisher: Sociedade Brasileira de Matemática
Keywords:
Mathematics Combinatorics
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
9
Refs
0.33
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
graph theory and CDMA systems
Physical Sciences → Engineering → Electrical and Electronic Engineering
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
On equitable total coloring of snarks
Isabel F.A. GonçalvesSimone DantasDiana Sasaki
Journal: Procedia Computer Science Year: 2021 Vol: 195 Pages: 334-342
JOURNAL ARTICLE
Snarks and flow-snarks constructed from coloring-snarks
Journal: Discrete Mathematics Year: 2003 Vol: 278 (1-3)Pages: 165-174
JOURNAL ARTICLE
On the equitable total coloring of Loupekine snarks
Journal: Matemática Contemporânea Year: 2023 Vol: 55 (14)
JOURNAL ARTICLE
Coloring Block Designs is NP-Complete
Charles J. ColbournMarlene J. ColbournKevin T. PhelpsVojtěch Rödl
Journal: SIAM Journal on Algebraic and Discrete Methods Year: 1982 Vol: 3 (3)Pages: 305-307
JOURNAL ARTICLE
Quantum Feasibility Labeling for NP-Complete Vertex Coloring Problem
Journal: IEEE Access Year: 2025 Vol: 13 Pages: 46972-46982