Total list weighting of Cartesian product of graphs

DOI10.1016/J.DAM.2025.01.043MaRDI QIDQ7011776zbMATH OpenFDO

Authors Yunfang Tang, Yuting Yao

Publication date 18 March 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.01.043

zbMATH Keywords

1-2 conjecture1-2-3 conjectureCartesian product graphcombinatorial Nullstellensatztotal weight choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• A solution to the 1-2-3 conjecture
• Combinatorial Nullstellensatz
• Edge weights and vertex colours
• Every graph is (2,3)-choosable
• Every nice graph is (1,5)-choosable
• From the 1-2-3 conjecture to the Riemann hypothesis
• List total weighting of graphs
• On a 1,2 conjecture
• 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
• Total weight choosability of graphs: towards the 1-2-3-conjecture
• Weight choosability of graphs

This page was built for publication: Total list weighting of Cartesian product of graphs

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