1 citations · 2 across the 6 of their papers we have counts for
6 papers · 1 filter
Inversion diameter and 2-edge-colored homomorphisms
Carmen Arana, Thomas Bellitto, Hector Buffière +3
In an oriented graph, the inversion of a subset of vertices X is the operation reversing the direction of every arc with both endpoints in X. Given a graph G, the inversion distanc…
Chromatic discrepancy of locally -colourable graphs
Timothée Corsini, Lucas Picasarri-Arrieta, Théo Pierron +2
The chromatic discrepancy of a graph , denoted , is the least over all proper colourings of of the greatest difference between the number of colours sp…
Determining a graph from its reconfiguration graph
Gaétan Berthe, Caroline Brosse, Brian Hearn +3
Given a graph and a natural number , the -recolouring graph is the graph whose vertices are the -colourings of and whose edges link pairs of col…
Improved pyrotechnics : Closer to the burning graph conjecture
Paul Bastide, Marthe Bonamy, Anthony Bonato +4
The Burning Number Conjecture claims that for every connected graph of order its burning number satisfies While the conjecture remains o…
Coloring squares of graphs with mad constraints
Hervé Hocquard, Seog-Jin Kim, Théo Pierron
A proper vertex -coloring of a graph is an assignment of colors to the vertices of the graph such that no two adjacent vertices are associate…
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles
Ilkyoo Choi, Daniel W. Cranston, Théo Pierron
We prove several results on coloring squares of planar graphs without 4-cycles. First, we show that if is such a graph, then is -degenerate. This implies an up…