JOURNAL ARTICLE

Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete

Michał Karpiński

Year: 2016 Journal:   Theoretical Computer Science Vol: 659 Pages: 88-94   Publisher: Elsevier BV
Keywords:
Monochromatic color Combinatorics Mathematics Vertex (graph theory) Graph coloring Reduction (mathematics) Greedy coloring Satisfiability Discrete mathematics Graph Graph power Physics Line graph

Metrics

10
Cited By
1.81
FWCI (Field Weighted Citation Impact)
19
Refs
0.90
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Scheduling and Timetabling Solutions
Social Sciences →  Decision Sciences →  Management Science and Operations Research
Vehicle Routing Optimization Methods
Physical Sciences →  Engineering →  Industrial and Manufacturing Engineering
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length

Yaroslav Shitov

Journal:   Theoretical Computer Science Year: 2017 Vol: 674 Pages: 116-118
JOURNAL ARTICLE

Quantum Feasibility Labeling for NP-Complete Vertex Coloring Problem

Junpeng Zhan

Journal:   IEEE Access Year: 2025 Vol: 13 Pages: 46972-46982
JOURNAL ARTICLE

Vertex coloring complete multipartite graphs from random lists of size 2

Carl Johan Casselgren

Journal:   Discrete Mathematics Year: 2010 Vol: 311 (13)Pages: 1150-1157
JOURNAL ARTICLE

Properly colored cycles in edge-colored complete graphs without monochromatic triangle: A vertex-pancyclic analogous result

Ruonan Li

Journal:   Discrete Mathematics Year: 2021 Vol: 344 (11)Pages: 112573-112573
© 2026 ScienceGate Book Chapters — All rights reserved.