Hereditary Graph Classes: When the Complexities of Coloring and Clique Cover Coincide

Journal of Graph Theory - United States
doi 10.1002/jgt.22431
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

The Coloring Reconfiguration Problem on Specific Graph Classes

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2019English

Selective Graph Coloring in Some Special Classes of Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Clique Coloring of Binomial Random Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2018English

Experiments With Parallel Graph Coloring Heuristics and Applications of Graph Coloring

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1996English

The Complexity of Clique Graph Recognition

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2009English

Polynomial Approximation and Graph-Coloring

Computing (Vienna/New York)
Numerical AnalysisComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2003English

Mixed Graph Edge Coloring

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Graph Coloring With webMathematica

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Voter Model on the Two-Clique Graph

Physical Review E
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy