Choosability and Paintability of the Lexicographic Product of Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2017.02.008
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Protection of Lexicographic Product Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Lexicographic Product of Standard Graphs Using Claw Decompositions

International Journal of Research in Advent Technology
2019English

The Harmonic Index of Graphs Based on Some Operations Related to the Lexicographic Product

Mathematical Sciences
2019English

A Note on the Equitable Choosability of Complete Bipartite Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Choosability of the Square of Planar Subcubic Graphs With Large Girth

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

NSD Total Choosability of Planar Graphs With Girth at Least Four

2016English

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

International Journal of Mathematics and Mathematical Sciences
Mathematics
2015English

Affine Completeness and Lexicographic Product Decompositions of Abelian Lattice Ordered Groups

Czechoslovak Mathematical Journal
Mathematics
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy