Total weight choosability for Halin graphs

DOI10.5614/EJGTA.2021.9.1.2MaRDI QIDQ4958040zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

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

zbMATH Keywords

\((kHalin graphsk')\)-matrixtotal weighting

Mathematics Subject Classification ID

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

Abstract: A proper total weighting of a graph $G$ is a mapping $phi$ which assigns to each vertex and each edge of $G$ a real number as its weight so that for any edge $uv$ of $G$, $su{m}_{einE(v)}phi(e)+phi(v)esu{m}_{einE(u)}phi(e)+phi(u)$. A $(k,k^{\prime })$-list assignment of $G$ is a mapping $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ permissible weights and to each edge $e$ a set $L(e)$ of $k^{\prime }$ permissible weights. An $L$-total weighting is a total weighting $phi$ with $phi(z)inL(z)$ for each $zinV(G)cupE(G)$. A graph $G$ is called $(k,k^{\prime })$-choosable if for every $(k,k^{\prime })$-list assignment $L$ of $G$, there exists a proper $L$-total weighting. As a strenghtening of the well-known 1-2-3 conjecture, it was conjectured in [ Wong and Zhu, Total weight choosability of graphs, J. Graph Theory 66 (2011), 198-212] that every graph without isolated edge is $(1,3)$-choosable. It is easy to verified this conjecture for trees, however, to prove it for wheels seemed to be quite non-trivial. In this paper, we develop some tools and techniques which enable us to prove this conjecture for generalized Halin graphs.

Recommendations

• On total weight choosability of graphs
• Total weight choosability of graphs: towards the 1-2-3-conjecture
• Every graph is (2,3)-choosable
• Total weight choosability of graphs
• Total weight choosability of Mycielski graphs

Cites work

• A nowhere-zero point in linear mappings
• Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
• Colorings and orientations of graphs
• Combinatorial Nullstellensatz
• Edge weights and vertex colours
• Every graph is (2,3)-choosable
• List total weighting of graphs
• On a 1,2 conjecture
• On total weight choosability of graphs
• On vertex-coloring 13-edge-weighting
• Permanent index of matrices associated with graphs
• Total weight choosability of Cartesian product of graphs
• Total weight choosability of graphs
• Total weight choosability of graphs
• Vertex colouring edge partitions
• Vertex-coloring edge-weightings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Vertex-colouring edge-weightings
• Weight choosability of graphs

Cited in

(10)

• On total weight choosability of graphs
• Total weight choosability of graphs: towards the 1-2-3-conjecture
• Every nice graph is (1,5)-choosable
• Total weight choosability of cone graphs
• Total weight choosability of Cartesian product of graphs
• A note on 1-2-3 conjecture for Halin graphs
• Permanent index of matrices associated with graphs
• Weight choosability of oriented hypergraphs
• Total weight choosability of graphs
• On list coloring with separation of the complete graph and set system intersections

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958040)