Complete Multipartite Graphs and the Relaxed Coloring Game

Order - Netherlands
doi 10.1007/s11083-011-9217-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Relaxed Two-Coloring of Cubic Graphs

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

Quotients of Complete Multipartite Graphs

Pacific Journal of Mathematics
Mathematics
1976English

Complete Multipartite Graphs and Braess Edges

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2019English

Decompositions of Complete Multipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Hamiltonian Cycle in Complete Multipartite Graphs

Annals of Pure and Applied Mathematics
2017English

Critical Groups for Complete Multipartite Graphs and Cartesian Products of Complete Graphs

Journal of Graph Theory
GeometryTopology
2003English

Optimal Strong Parity Edge-Coloring of Complete Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2008English

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

Journal of Engineering Science and Technology Review
Engineering
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy