The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture

DOI10.1016/j.jctb.2016.06.010zbMath1348.05085OpenAlexW2489305169WikidataQ56926519 ScholiaQ56926519MaRDI QIDQ326818

Cun-Quan Zhang, Carsten Thomassen, Ye-Zhou Wu

Publication date: 12 October 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2016.06.010

zbMATH Keywords

1-2-3-conjecturefactors modulo \(k\)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (30)

On Proper Labellings of Graphs with Minimum Label Sum ⋮ Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture ⋮ Neighbour-distinguishing labellings of families of graphs ⋮ Decomposing graphs into a constant number of locally irregular subgraphs ⋮ Going wide with the 1-2-3 conjecture ⋮ An injective version of the 1-2-3 conjecture ⋮ On the standard \((2,2)\)-conjecture ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles ⋮ Antifactors of regular bipartite graphs ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ Neighbour sum distinguishing edge-weightings with local constraints ⋮ A note on a directed version of the 1-2-3 conjecture ⋮ On a total version of 1-2-3 conjecture ⋮ A notion of vertex equitability for proper labellings ⋮ On inducing degenerate sums through 2-labellings ⋮ A solution to the 1-2-3 conjecture ⋮ On the role of 3's for the 1-2-3 conjecture ⋮ On minimizing the maximum color for the 1-2-3 conjecture ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs ⋮ On the role of 3s for the 1--2--3 conjecture ⋮ Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs ⋮ Note on the group edge irregularity strength of graphs ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ Further results on an equitable 1-2-3 conjecture ⋮ On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\) ⋮ Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs ⋮ 1-2-3 Conjecture in digraphs: more results and directions ⋮ Edge weights and vertex colours: minimizing sum count ⋮ On proper labellings of graphs with minimum label sum

Cites Work

• Unnamed Item
• Unnamed Item
• Graph factors modulo \(k\)
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Vertex-coloring 2-edge-weighting of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On vertex-coloring 13-edge-weighting
• Edge-decompositions of highly connected graphs into paths
• Matching theory
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• Vertex colouring edge partitions
• Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
• Claw‐decompositions and tutte‐orientations
• The Factors of Graphs
• The Erdős-Pósa property for odd cycles in graphs of large connectivity

This page was built for publication: The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture