Imagen de Portada

On graphs with girth at least five achieving Steffen's edge coloring bound

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Guantao, Fiujlaali, Alireza, Johnsen-Yu, Anna, McDonald, Jessica
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Extending total colorings in planar graphs
por: Henderschedt, Owen, et al.
Publicado: (2025)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
por: La, Hoang, et al.
Publicado: (2021)

Total coloring graphs with large minimum degree
por: Henderschedt, Owen, et al.
Publicado: (2025)

Total coloring graphs with large maximum degree
por: Dalal, Aseem, et al.
Publicado: (2024)

Some results on 2-distance coloring of planar graphs with girth five
por: Deniz, Zakir
Publicado: (2023)

Exhaustive generation of edge-girth-regular graphs
por: Goedgebeur, Jan, et al.
Publicado: (2024)

Coloring graphs with independence number two and no odd clique immersions
por: Echeverría, Henry, et al.
Publicado: (2026)

On graphs with chromatic number and maximum degree both equal to nine
por: Galindo, Rachel, et al.
Publicado: (2024)

On conflict-free colorings of cyclic polytopes and the girth conjecture for graphs
por: Lee, Seunghun, et al.
Publicado: (2024)

Impact of local girth on the S-packing coloring of k-saturated subcubic graphs
por: Zein, Ayman El, et al.
Publicado: (2026)

On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration
por: Jajcay, Robert, et al.
Publicado: (2024)

Optimally reconnecting graphs against an edge-destroying adversary
por: McDonald, Daniel C.
Publicado: (2021)

Extending partial edge-colorings of bounded size in Cartesian products of graphs
por: Bärnkopf, Pál, et al.
Publicado: (2026)

An improved bound for 2-distance coloring of planar graphs with girth six
por: Deniz, Zakir
Publicado: (2022)

Nonexistence of certain edge-girth-regular graphs
por: Droogendijk, Leen
Publicado: (2024)

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

On extremal (almost) edge-girth-regular graphs
por: Araujo-Pardo, Gabriela, et al.
Publicado: (2024)

$t$-tone edge coloring of graphs
por: Bazzal, Hadeel Al
Publicado: (2026)

On orientations with forbidden out-degrees
por: Henderschedt, Owen, et al.
Publicado: (2024)

Oriented diameter of graphs with diameter $4$ and given edge girth
por: Lin, Jifu, et al.
Publicado: (2025)

Eigenvalue bounds for distance-edge colorings
por: Abiad, Aida, et al.
Publicado: (2025)

Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications
por: Kuang, Peiru, et al.
Publicado: (2026)

Laplacian eigenvalue distribution and girth of graphs
por: Zhen, Wenhao, et al.
Publicado: (2025)

Vertex-distinguishing edge coloring of graphs
por: Gao, Yuping, et al.
Publicado: (2025)

Semistrong edge colorings of planar graphs
por: Lin, Yuquan, et al.
Publicado: (2024)

Rainbow matchings in edge-colored graphs
por: Lu, Hongliang, et al.
Publicado: (2025)

Graphs with girth $2\ell$ and without longer even holes are $3$-colorable
por: Chen, Rong
Publicado: (2025)

A note on strong edge-colorings of 2-degenerate graphs
por: Luo, Rong, et al.
Publicado: (2012)

Cubic vertex-transitive graphs of girth seven
por: Lekše, Maruša, et al.
Publicado: (2025)

On cubic vertex-transitive graphs of given girth
por: Dobson, Ted, et al.
Publicado: (2025)

On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs
por: Liu, Xujun, et al.
Publicado: (2024)

Counting rainbow triangles in edge-colored graphs
por: Li, Xueliang, et al.
Publicado: (2021)

Computational results on semistrong edge coloring of graphs
por: Lin, Yuquan, et al.
Publicado: (2025)

Large rainbow matchings in edge-colored graphs
por: Chakraborti, Debsoumya, et al.
Publicado: (2020)

Packing edge-colorings of subcubic outerplanar graphs
por: Li, Sijin, et al.
Publicado: (2024)

Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
por: Galindo, Rachel, et al.
Publicado: (2025)

Degree sequences realizing labelled perfect matchings
por: Briggs, Joseph, et al.
Publicado: (2025)

Graphs with girth 8 and without longer even holes are 3-colorable
por: Wang, Yan, et al.
Publicado: (2026)

A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
por: Chen, Guantao, et al.
Publicado: (2023)

A bound on the girth of quaternion unit gain graphs in terms of the rank
por: Khan, Suliman, et al.
Publicado: (2024)