Cover Image

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bastida, Sam, Brettell, Nick
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Proper conflict-free choosability of planar graphs
by: Wang, Yuting, et al.
Published: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Comparing Width Parameters on Graph Classes
by: Brettell, Nick, et al.
Published: (2023)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

On the maximum number of edges of outer k-planar graphs
by: Pfister, Maximilian
Published: (2025)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)

Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)

Sums of $k$-bonacci Numbers
by: Parks, Harold R., et al.
Published: (2022)

$k$-Hyperopic Cops and Robber
by: Crawford, Nicholas, et al.
Published: (2024)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
by: Adekanye, Melvin, et al.
Published: (2024)

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
by: Bénéteau, Laurine, et al.
Published: (2022)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Treewidth of Outer $k$-Planar Graphs
by: Pyzik, Rafał
Published: (2025)

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
by: la Tour, Max Dupré, et al.
Published: (2024)

A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)

On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses
by: Caragiannis, Ioannis, et al.
Published: (2024)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)

On the expressive power of $2$-edge-colourings of graphs
by: Bok, Jan, et al.
Published: (2025)

On $k$-planar Graphs without Short Cycles
by: Bekos, Michael A., et al.
Published: (2024)

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

Hamiltonian connectivity of some base-cobase graphs
by: Martínez-Sandoval, Leonardo, et al.
Published: (2025)

An Upper Bound on the Linear Turán Number of $k$-Crowns
by: Adak, Rajat
Published: (2026)

On $(k,g)$-Graphs without $(g+1)$-Cycles
by: Eze, Leonard Chidiebere, et al.
Published: (2024)

Efficient $k$-limited Dominating Broadcasts in Product Graphs
by: Bharadwaj, et al.
Published: (2025)

Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)

Multigraph edge-coloring with local list sizes
by: Dhawan, Abhishek
Published: (2023)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
by: Eze, L. C., et al.
Published: (2025)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
by: Foucaud, Florent, et al.
Published: (2025)