DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Complete coloring
Complete coloring
The Vertex Coloring Problem and Its Generalizations
Indian Journal of Science ANALYSIS International Journal for Science ISSN 2319 – 7730 EISSN 2319 – 7749
List of NP-Complete Problems from Wikipedia, the Free Encyclopedia
Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models
Variations on Memetic Algorithms for Graph Coloring Problems Laurent Moalic, Alexandre Gondran
On the Achromatic Number of Certain Distance Graphs 1 Introduction
The First-Fit Chromatic and Achromatic Numbers
Graph Coloring Algorithms on Random Graphs
Graph Colorings
An Exact Algorithm with Learning for the Graph Coloring Problem$
Analysis of Algorithms for Star Bicoloring and Related Problems A
NP-Completeness Results for Some Problems on Subclasses of Bipartite and Chordal Graphs
The Harmonious Coloring Problem Is NP-Complete for Interval and Permutation Graphsଁ Katerina Asdre, Kyriaki Ioannidou, Stavros D
Bachelor Seminar Complexity Analysis of Register Allocation
An Approximation Algorithm for Complete Partitions of Regular Graphs
A Study on Graph Coloring Bharathi S N Assistant Professor GFGC, Kadugudi, Bengaluru
Classic Graph Problems Made Temporal – a Parameterized Complexity Analysis
Graph Factorization from Wikipedia, the Free Encyclopedia Contents
Top View
3-Coloring in Time O(1.3289
Equitable and Semi-Equitable Coloring of Cubic Graphs and Its Application in Batch Scheduling∗
Variations on Memetic Algorithms for Graph Coloring Problems
List of NP-Complete Problems from Wikipedia, the Free Encyclopedia
A Study of the Total Coloring of Graphs