:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bradshaw, Peter, Mohar, Bojan, Stacho, Ladislav
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C15
Online Access:	https://arxiv.org/abs/2409.01513
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable
by: Bi, Richard, et al.
Published: (2024)

On a conjecture concerning 4-coloring of graphs with one crossing
by: Dvořák, Zdeněk, et al.
Published: (2025)

Oriented Colouring Graphs of Bounded Degree and Degeneracy
by: Clow, Alexander, et al.
Published: (2023)

Strong log-convexity of genus sequences
by: Mohar, Bojan
Published: (2024)

Robust Connectivity of Graphs on Surfaces
by: Bradshaw, Peter, et al.
Published: (2021)

Coloring $(P_5, \text{gem})$-free graphs with $Δ-1$ colors
by: Cranston, Daniel W., et al.
Published: (2020)

Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)

All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)

On the hat guessing number of a planar graph class
by: Bradshaw, Peter
Published: (2021)

Simple eigenvalues of cubic vertex-transitive graphs
by: Guo, Krystal, et al.
Published: (2020)

Every signed planar graph is $5$-choosable: A short proof and refinements
by: Atangana, Pie Desire Ebode, et al.
Published: (2026)

The square of a subcubic planar graph without a 5-cycle is 7-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
by: Inoue, Yuta, et al.
Published: (2024)

Three-edge-coloring (Tait coloring) cubic graphs on the torus: A proof of Grünbaum's conjecture
by: Inoue, Yuta, et al.
Published: (2025)

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
by: Kashima, Masaki, et al.
Published: (2025)

Degree-choosability of proper conflict-free list coloring of sparse graphs
by: Kashima, Masaki, et al.
Published: (2026)

Paintability of $r$-chromatic graphs
by: Bradshaw, Peter, et al.
Published: (2024)

Flexible list coloring of graphs with maximum average degree less than $3$
by: Bi, Richard, et al.
Published: (2023)

Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
by: Deng, Kecai, et al.
Published: (2025)

Strong parity edge-colorings of graphs
by: Bradshaw, Peter, et al.
Published: (2024)

Hat guessing number and guaranteed subgraphs
by: Bradshaw, Peter
Published: (2021)

Minimal abundant packings and choosability with separation
by: Furedi, Zoltan, et al.
Published: (2013)

Single-conflict colorings of degenerate graphs
by: Bradshaw, Peter, et al.
Published: (2021)

A lower bound on the number of edges in DP-critical graphs
by: Bradshaw, Peter, et al.
Published: (2024)

On a conjecture of Gross, Mansour and Tucker for $Δ$-matroids
by: Avohou, Remi Cocou
Published: (2024)

A Note on Large Degenerate Induced Subgraphs in Sparse Graphs
by: Clow, Alexander, et al.
Published: (2025)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
by: Bradshaw, Peter, et al.
Published: (2024)

Clustered Colouring of Graph Products
by: Campbell, Rutger, et al.
Published: (2024)

Structure and generation of crossing-critical graphs
by: Dvořák, Zdeněk, et al.
Published: (2018)

Guarding isometric subgraphs and Cops and Robber in planar graphs
by: de la Maza, Sebastián González Hermosillo, et al.
Published: (2024)

Refinement of a conjecture on positive square energy of graphs
by: Akbari, Saieed, et al.
Published: (2025)

Hamiltonicity of covering graphs of trees
by: Bradshaw, Peter, et al.
Published: (2022)

A Counterexample to a Conjecture of Lovász
by: Clow, Alexander, et al.
Published: (2025)

Spectrally symmetric orientations of graphs
by: Akbari, Saieed, et al.
Published: (2025)

Chip games and multipartite graph paintability
by: Bradshaw, Peter, et al.
Published: (2024)

Flexible DP 3-coloring of sparse multigraphs
by: Bradshaw, Peter, et al.
Published: (2025)

Convex combination of first and second eigenvalues of trees
by: Kumar, Hitesh, et al.
Published: (2026)

Cops and robbers on directed and undirected abelian Cayley graphs
by: Bradshaw, Peter, et al.
Published: (2019)

Kempe Classes and Almost Bipartite Graphs
by: Cranston, Daniel W., et al.
Published: (2023)