Total weight choosability of Cartesian product of graphs
type: Item
instance of: scholarly article
title: Total weight choosability of Cartesian product of graphs
zbMATH Open document ID: 1248.05175
author: Tsai-Lien Wong
author: Jiaojiao Wu
author: Xuding Zhu
published in: European Journal of Combinatorics
publication date: 2012-09-12T00:00:00Z
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6081474
zbMATH Keywords: choosable graph
zbMATH Keywords: \(k\)-edge weighting
MaRDI profile type: Publication
full work available at URL: j.ejc.2012.04.004
OpenAlex ID: W2079982082
cites work: Vertex colouring edge partitions
cites work: Vertex-colouring edge-weightings
cites work: Combinatorial Nullstellensatz
cites work: A nowhere-zero point in linear mappings
cites work: Colorings and orientations of graphs
cites work: Weight choosability of graphs
cites work: Vertex-coloring edge-weightings of graphs
cites work: Total Weight Choosability of Trees
cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
cites work: Edge weights and vertex colours
cites work: Vertex-coloring 2-edge-weighting of graphs
cites work: Total weight choosability of graphs
DOI: 10.1016/J.EJC.2012.04.004
Recommended article: Total weight choosability of graphs
Recommended article: On total weight choosability of graphs
Recommended article: Weight choosability of graphs
Recommended article: Total weight choosability of Mycielski graphs
Recommended article: Total weight choosability for Halin graphs
Recommended article: Total weight choosability of cone graphs
Recommended article: Total weight choosability of graphs: towards the 1-2-3-conjecture
Recommended article: Total domination of Cartesian products of graphs
Recommended article: Total weight choosability of graphs with bounded maximum average degree
description: scientific article; zbMATH DE number 6081474