Restricted Coloring Problems on Graphs With Few P 4’s

Annals of Operations Research - Netherlands
doi 10.1007/s10479-014-1537-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On List-Coloring Extendable Outerplanar Graphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2012English

On R - Dynamic Coloring of Some Graphs

Kongunadu Research Journal
2020English

Coloring Square-Free Berge Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

On R - Dynamic Vertex Coloring of Some Graphs

Kongunadu Research Journal
2020English

Coloring Signed Graphs Using DFS

Optimization Letters
ControlOptimization
2015English

Strong Vertex-Distinguishing Total Coloring Algorithm for Complete Graphs Based on Equitable Coloring

Journal of Engineering Science and Technology Review
Engineering
2020English

Strong T-Coloring of Graphs

International Journal of Innovative Technology and Exploring Engineering
Mechanics of MaterialsElectronic EngineeringCivilStructural EngineeringElectricalComputer Science
2019English

Continuum Limits of Nonlocal $P$-Laplacian Variational Problems on Graphs

SIAM Journal on Imaging Sciences
MathematicsApplied Mathematics
2019English

Coloring Permutation Graphs in Parallel

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy