Total weight choosability for Halin graphs

DOI10.5614/ejgta.2021.9.1.2zbMath1468.05104arXiv1705.08150OpenAlexW3157554477MaRDI QIDQ4958040

Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.08150

zbMATH Keywords

Halin graphstotal weighting\((kk')\)-matrix

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Cites Work

• Total weight choosability of Cartesian product of graphs
• Permanent index of matrices associated with graphs
• Every graph is \((2,3)\)-choosable
• 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
• On vertex-coloring 13-edge-weighting
• Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
• Colorings and orientations of graphs
• Edge weights and vertex colours
• On total weight choosability of graphs
• Vertex-colouring edge-weightings
• Vertex colouring edge partitions
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Total weight choosability of graphs
• Total weight choosability of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Total weight choosability for Halin graphs