Coloring by Pushing Vertices
Dieter Rautenbach, Laurin Schwartze, Florian Werner

TL;DR
This paper investigates a vertex coloring method called proper pushing schemes, proving the conjecture for certain graph classes and establishing bounds on the scheme's parameters.
Contribution
The paper proves the conjecture for cubic and regular bipartite graphs and provides bounds on the total pushing scheme values for general graphs.
Findings
Conjecture holds for cubic graphs.
Conjecture holds for regular bipartite graphs.
Bounds on total pushing scheme values are established.
Abstract
Let be a graph of order , maximum degree at most , and no component of order . Inspired by the famous 1-2-3-conjecture, Bensmail, Marcille, and Orenga define a proper pushing scheme of as a function for which is a vertex coloring, that is, adjacent vertices receive different values under . They show the existence of a proper pushing scheme with and conjecture that this upper bound can be improved to . We show their conjecture for cubic graphs and regular bipartite graphs. Furthermore, we show the existence of a proper pushing scheme with .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Finite Group Theory Research
