List total weighting of graphs

MaRDI QIDQ3060867zbMATH OpenFDO

Authors Tsai-Lien Wong, Daqing Yang, Xuding Zhu

Publication date 13 December 2010

zbMATH Keywords

choosabilitygraphsweighting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Recommendations

• Total weight choosability of graphs
• Total list weighting of graphs with bounded maximum average degree
• Total weight choosability of graphs
• On total weight choosability of graphs
• Weight choosability of graphs

Cited in

(14)

• Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
• Total list weighting of graphs with bounded maximum average degree
• On total weight choosability of graphs
• Total weight choosability of graphs: towards the 1-2-3-conjecture
• Total weight choosability of graphs with bounded maximum average degree
• Total weight choosability of cone graphs
• Weight choosability of graphs
• The 1,2,3-conjecture and 1,2-conjecture for sparse graphs
• Total weight choosability for Halin graphs
• Permanent index of matrices associated with graphs
• Total weight choosability of Mycielski graphs
• Every graph is (2,3)-choosable
• Total Weight Choosability of Trees
• Total list weighting of Cartesian product of graphs

This page was built for publication: List total weighting of graphs

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