Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth

doi 10.1137/1.9781611975031.19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Experiments With Parallel Graph Coloring Heuristics and Applications of Graph Coloring

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1996English

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

Book Review: Graph Coloring Problems

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1996English

Polynomial Approximation and Graph-Coloring

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

Graph Coloring Using Eigenvalue Decomposition

SIAM Journal on Algebraic Discrete Methods
1984English

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

2020English

Effective and Efficient Dynamic Graph Coloring

Proceedings of the VLDB Endowment
Computer Science
2017English

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy