Dense Eulerian graphs are \((1, 3)\)-choosable

DOI10.37236/10563zbMath1492.05083arXiv2109.00792OpenAlexW3197941730MaRDI QIDQ2152793

Hua Jing Lu, Xuding Zhu

Publication date: 11 July 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

total weighting of a graphvertex coloring \(k\)-edge weighting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45) Signed and weighted graphs (05C22) Fractional graph theory, fuzzy graph theory (05C72)

Cites Work

• Unnamed Item
• Total weight choosability of cone graphs
• Every graph is \((2,3)\)-choosable
• A nowhere-zero point in linear mappings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On vertex-coloring 13-edge-weighting
• Graphs are \((1, \varDelta + 1)\)-choosable
• Edge weights and vertex colours
• Total weight choosability of graphs: towards the 1-2-3-conjecture
• From the 1-2-3 conjecture to the Riemann hypothesis
• 2-connected chordal graphs and line graphs are \((1,5)\)-choosable
• Vertex-colouring edge-weightings
• Vertex colouring edge partitions
• Weight choosability of graphs
• The 1‐2‐3‐conjecture holds for dense graphs
• Total Weight Choosability of Trees
• Total weight choosability of graphs
• Total weight choosability of graphs
• Edge-decompositions of graphs with high minimum degree

This page was built for publication: Dense Eulerian graphs are \((1, 3)\)-choosable