Total weight choosability of Cartesian product of graphs

DOI10.1016/j.ejc.2012.04.004zbMath1248.05175OpenAlexW2079982082MaRDI QIDQ449198

Tsai-Lien Wong, Xuding Zhu, Jiaojiao Wu

Publication date: 12 September 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.04.004

zbMATH Keywords

\(k\)-edge weightingchoosable graph

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Related Items (9)

Total weight choosability of cone graphs ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable ⋮ Total Weight Choosability of Trees ⋮ Weight choosability of graphs with maximum degree 4 ⋮ Total weight choosability of Mycielski graphs ⋮ Every graph is \((2,3)\)-choosable ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Total weight choosability for Halin graphs

Cites Work

• Vertex-coloring 2-edge-weighting of graphs
• Vertex-coloring edge-weightings of graphs
• A nowhere-zero point in linear mappings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Colorings and orientations of graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Vertex colouring edge partitions
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Total Weight Choosability of Trees
• Total weight choosability of graphs

This page was built for publication: Total weight choosability of Cartesian product of graphs