On(k,kn-K2-2k-1)-Choosability Ofn-Vertex Graphs

International Journal of Mathematics and Mathematical Sciences- United States

doi 10.1155/2015/690517

Full Text

Abstract

Available in

Categories

Date

January 1, 2015

Authors

Wongsakorn Charoenpanitseri

Publisher

Hindawi Limited

Related search

A Note on the Equitable Choosability of Complete Bipartite Graphs

Discussiones Mathematicae - Graph Theory

Applied Mathematics

Discrete Mathematics

English

On Limit Graphs of Finite Vertex-Primitive Graphs

Journal of Combinatorial Theory - Series A

Computational Theory

Discrete Mathematics

Theoretical Computer Science

English

The Edge-Labeling and Vertex-Colors of Kn

Mathematical Sciences

English

Power Domination in Kn\"odel Graphs and Hanoi Graphs

Discussiones Mathematicae - Graph Theory

Applied Mathematics

Discrete Mathematics

English

Vertex Maps on Graphs-Trace Theorems

Fixed Point Theory and Applications

Applied Mathematics

English

Choosability and Paintability of the Lexicographic Product of Graphs

Discrete Applied Mathematics

Applied Mathematics

Discrete Mathematics

English

Algorithmic Aspects of Vertex Elimination on Graphs

SIAM Journal on Computing

Computer Science

English

Parity Results for Broken K-Diamond Partitions and (2k+1)-Cores

Acta Arithmetica

English

Vertex Distinguishing General-Total Coloring of K2, 5, P

Scholars Journal of Physics, Mathematics and Statistics

English