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

Michał Karpiński

doi:10.1016/j.tcs.2016.10.011

ScienceGate Book Chapters

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

DOI: 10.1016/j.tcs.2016.10.011

Get Full-Text PDF Get Analytical Report

Keywords:

Monochromatic color Combinatorics Mathematics Vertex (graph theory) Graph coloring Reduction (mathematics) Greedy coloring Satisfiability Discrete mathematics Graph Graph power Physics Line graph

Metrics

Cited By

1.81

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Citation History

Topics

Related Documents

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

Quantum Feasibility Labeling for NP-Complete Vertex Coloring Problem

Vertex coloring complete multipartite graphs from random lists of size 2

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

Coloring Graphs While Avoiding Monochromatic Cycles