Total weight choosability of Mycielski graphs

DOI10.1007/S10878-015-9943-1zbMath1364.05034OpenAlexW1450848502MaRDI QIDQ512875

Yunfang Tang, Xuding Zhu

Publication date: 3 March 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9943-1

zbMATH Keywords

permanentMycielski graphmatrixcombinatorial Nullstellensatztotal weight choosability

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Related Items (2)

Total weight choosability of cone graphs ⋮ Nordhaus-Gaddum and other bounds for the chromatic edge-stability number

Cites Work

• Unnamed Item
• Total weight choosability of Cartesian product of graphs
• Permanent index of matrices associated with graphs
• Every graph is \((2,3)\)-choosable
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On vertex-coloring 13-edge-weighting
• Colorings and orientations of graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Total weight choosability of graphs
• Total weight choosability of graphs

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