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 full text

Categories
Mathematics
Date
Authors
Publisher

Hindawi Limited

Related search

The Edge-Labeling and Vertex-Colors of Kn

Mathematical Sciences
2012English

On Limit Graphs of Finite Vertex-Primitive Graphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2007English

A Note on the Equitable Choosability of Complete Bipartite Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Vertex Maps on Graphs-Trace Theorems

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2011English

Power Domination in Kn\"odel Graphs and Hanoi Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Algorithmic Aspects of Vertex Elimination on Graphs

SIAM Journal on Computing
MathematicsComputer Science
1976English

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

Acta Arithmetica
Number TheoryAlgebra
2011English

Choosability and Paintability of the Lexicographic Product of Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

On Integral Sum Graphs With a Saturated Vertex

Czechoslovak Mathematical Journal
Mathematics
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy