The multigraph formulation of the (2,2) Conjecture
The multigraph formulation of the (2,2) Conjecture
Let be a connected graph of order . Let denote the family of multigraphs obtained from a graph by edge multiplication with edge multiplicities at most , and call a multigraph locally irregular when adjacent vertices have distinct degrees. (2,2) Conjecture. The graph can be decomposed into two subgraphs and such that there exist locally irregular multigraphs
This is the multigraph formulation of the preceding -coloring conjecture. Its general status is open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Igor Grzelec and Mariusz Woźniak, “On decomposing multigraphs into locally irregular submultigraphs”, arXiv:2208.08809 (2022).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.