Total weight choosability of cone graphs

DOI10.1007/s00373-015-1633-3zbMath1339.05172OpenAlexW2113432752MaRDI QIDQ293660

Yunfang Tang, Xuding Zhu, Tsai-Lien Wong

Publication date: 9 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1633-3

zbMATH Keywords

permanentmatrix\(m\)-cone graphcombinatorial Nullstellensatztotal weight choosability

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Related Items (3)

Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ Every nice graph is (1,5)-choosable

Cites Work

• Total weight choosability of Cartesian product of graphs
• Permanent index of matrices associated with graphs
• Total weight choosability of Mycielski graphs
• Every graph is \((2,3)\)-choosable
• A nowhere-zero point in linear mappings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• On total weight choosability of graphs
• Vertex-colouring edge-weightings
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Sur le coloriage des graphs
• Total weight choosability of graphs
• Total weight choosability of graphs
• Unnamed Item
• Unnamed Item

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