Coloring Random and Semi-Random K-Colorable Graphs

Journal of Algorithms
doi 10.1006/jagm.1995.1034
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

List Coloring of Random and Pseudo-Random Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1999English

Equitable Coloring of Random Graphs

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

Clique Coloring of Binomial Random Graphs

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

Sandwiching Random Regular Graphs Between Binomial Random Graphs

2020English

Random Graphs' Robustness in Random Environment

Austrian Journal of Statistics
UncertaintyApplied MathematicsStatisticsProbability
2017English

An Expected Polynomial Time Algorithm for Coloring 2-Colorable 3-Graphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Percolation and Random Graphs

2009English

Nilpotent Adjacency Matrices, Random Graphs and Quantum Random Variables

Journal of Physics A: Mathematical and Theoretical
StatisticsProbabilityNonlinear PhysicsSimulationMathematical PhysicsStatisticalModelingAstronomyPhysics
2008English

Almost All K-Colorable Graphs Are Easy to Color

Journal of Algorithms
1988English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy