Sharp Bounds on Lengths of Linear Recolouring Sequences
Fuente:
arXiv
Saved in:
| Main Authors: | Cambie, Stijn, van Batenburg, Wouter Cames, Cranston, Daniel W. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fractional list packing for layered graphs
by: Cambie, Stijn, et al.
Published: (2024)
by: Cambie, Stijn, et al.
Published: (2024)
5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles
by: Cranston, Daniel W., et al.
Published: (2022)
by: Cranston, Daniel W., et al.
Published: (2022)
Disjoint Correspondence Colorings for $K_5$-Minor-free Graphs
by: van Batenburg, Wouter Cames, et al.
Published: (2026)
by: van Batenburg, Wouter Cames, et al.
Published: (2026)
List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)
by: Cambie, Stijn, et al.
Published: (2023)
Recolouring Homomorphisms to triangle-free reflexive graphs
by: Lee, Jae-baek, et al.
Published: (2021)
by: Lee, Jae-baek, et al.
Published: (2021)
Bounding Clique Size in Squares of Planar Graphs
by: Cranston, Daniel W.
Published: (2023)
by: Cranston, Daniel W.
Published: (2023)
Sharp results for the Erdős, Pach, Pollack and Tuza problem
by: Cambie, Stijn, et al.
Published: (2025)
by: Cambie, Stijn, et al.
Published: (2025)
The average solution of a TSP instance in a graph
by: Cambie, Stijn
Published: (2022)
by: Cambie, Stijn
Published: (2022)
Šoltés' hypergraphs
by: Cambie, Stijn
Published: (2024)
by: Cambie, Stijn
Published: (2024)
Abundancy of $z$-\v Soltés' digraphs
by: Cambie, Stijn
Published: (2024)
by: Cambie, Stijn
Published: (2024)
Towards the essence of Šoltés' problem
by: Cambie, Stijn
Published: (2024)
by: Cambie, Stijn
Published: (2024)
Diameter reduction via arc reversal
by: Gehér, Panna, et al.
Published: (2024)
by: Gehér, Panna, et al.
Published: (2024)
Uniform Šoltés' hypergraphs and Šoltés' weighted graphs
by: Cambie, Stijn, et al.
Published: (2025)
by: Cambie, Stijn, et al.
Published: (2025)
On the largest chromatic number of $F$-free hypergraphs
by: Wang, Yichen, et al.
Published: (2026)
by: Wang, Yichen, et al.
Published: (2026)
Mutual k-Visibility in Graphs
by: B, Tonny K, et al.
Published: (2026)
by: B, Tonny K, et al.
Published: (2026)
Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
by: Cambie, Stijn, et al.
Published: (2023)
by: Cambie, Stijn, et al.
Published: (2023)
A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
by: Bousquet, Nicolas, et al.
Published: (2025)
by: Bousquet, Nicolas, et al.
Published: (2025)
Genetic algorithm and edge-colorings of complete graphs with connected classes
by: Cervantes-Ojeda, Jorge, et al.
Published: (2024)
by: Cervantes-Ojeda, Jorge, et al.
Published: (2024)
Reflexive Digraph Reconfiguration by Orientation Strings
by: Pullas, David Emmanuel Pazmiño, et al.
Published: (2025)
by: Pullas, David Emmanuel Pazmiño, et al.
Published: (2025)
The maximum number of connected sets in regular graphs
by: Cambie, Stijn, et al.
Published: (2023)
by: Cambie, Stijn, et al.
Published: (2023)
Algorithms for the Generation of Snarks
by: Brinkmann, Gunnar, et al.
Published: (2026)
by: Brinkmann, Gunnar, et al.
Published: (2026)
Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
by: De Meyer, Lucas
Published: (2025)
by: De Meyer, Lucas
Published: (2025)
Independent transversals in bipartite correspondence-covers
by: Cambie, Stijn, et al.
Published: (2020)
by: Cambie, Stijn, et al.
Published: (2020)
On the main distance-based entropies: the eccentricity- and Wiener-entropy
by: Cambie, Stijn, et al.
Published: (2022)
by: Cambie, Stijn, et al.
Published: (2022)
Progress on Albertson's Conjecture
by: Cranston, Daniel W.
Published: (2025)
by: Cranston, Daniel W.
Published: (2025)
Coloring graphs as complete graph invariants
by: Asgarli, Shamil, et al.
Published: (2025)
by: Asgarli, Shamil, et al.
Published: (2025)
Asymmetric list sizes in bipartite graphs
by: Alon, Noga, et al.
Published: (2020)
by: Alon, Noga, et al.
Published: (2020)
Linear-Time Computation of the Frobenius Normal Form for Symmetric Toeplitz Matrices via Graph-Theoretic Decomposition
by: Chu, Hojin, et al.
Published: (2025)
by: Chu, Hojin, et al.
Published: (2025)
Cliques in Squares of Graphs with Maximum Average Degree less than 4
by: Cranston, Daniel W., et al.
Published: (2023)
by: Cranston, Daniel W., et al.
Published: (2023)
Token Jumping in Planar Graphs has Linear Sized Kernels
by: Cranston, Daniel W.
Published: (2024)
by: Cranston, Daniel W.
Published: (2024)
5-Coloring Planar Graphs with a Color Class of Order at Most $|V|/6$
by: Inoue, Yuta, et al.
Published: (2025)
by: Inoue, Yuta, et al.
Published: (2025)
Local Search Improvements for Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)
$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
by: Zaker, Manouchehr
Published: (2024)
by: Zaker, Manouchehr
Published: (2024)
On the structure of (dart, odd hole)-free graphs
by: Hoàng, Chính T.
Published: (2025)
by: Hoàng, Chính T.
Published: (2025)
Independent Locating-Dominating Sets in Pseudotrees
by: Cáceres, José, et al.
Published: (2026)
by: Cáceres, José, et al.
Published: (2026)
The Mutual-Visibility Problem In Directed Graphs
by: Stojanović, Vanja
Published: (2026)
by: Stojanović, Vanja
Published: (2026)
$5$-list-coloring toroidal $6$-regular triangulations in linear time
by: Balachandran, Niranjan, et al.
Published: (2021)
by: Balachandran, Niranjan, et al.
Published: (2021)
More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
by: Zaker, Manouchehr
Published: (2021)
by: Zaker, Manouchehr
Published: (2021)
Reconstructing a graph from the distance matrix of its boundary
by: Cáceres, José, et al.
Published: (2024)
by: Cáceres, José, et al.
Published: (2024)
Similar Items
-
Fractional list packing for layered graphs
by: Cambie, Stijn, et al.
Published: (2024) -
5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles
by: Cranston, Daniel W., et al.
Published: (2022) -
Disjoint Correspondence Colorings for $K_5$-Minor-free Graphs
by: van Batenburg, Wouter Cames, et al.
Published: (2026) -
List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023) -
Recolouring Homomorphisms to triangle-free reflexive graphs
by: Lee, Jae-baek, et al.
Published: (2021)