Imagen de Portada

The strong chromatic index of $K_{t,t}$-free graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bi, Richard, Bradshaw, Peter, Dhawan, Abhishek, Xu, Jingwei
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Independent sets and colorings of $K_{t,t,t}$-free graphs
por: Dhawan, Abhishek, et al.
Publicado: (2025)

Toward Vu's conjecture
por: Bradshaw, Peter, et al.
Publicado: (2025)

Conflict-free chromatic index of trees
por: Guo, Shanshan, et al.
Publicado: (2024)

Fractional coloring via entropy
por: Dhawan, Abhishek
Publicado: (2026)

Multigraph edge-coloring with local list sizes
por: Dhawan, Abhishek
Publicado: (2023)

Balanced independent sets and colorings of hypergraphs
por: Dhawan, Abhishek
Publicado: (2023)

Balanced colorings of Erdős-Rényi hypergraphs
por: Dhawan, Abhishek, et al.
Publicado: (2025)

An improvement on the bound for the acyclic chromatic index
por: Kirousis, Lefteris, et al.
Publicado: (2026)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
por: Char, Arnab, et al.
Publicado: (2024)

Circular chromatic index of small graphs
por: Mazák, Ján, et al.
Publicado: (2026)

The chromatic number of triangle-free hypergraphs
por: Li, Lina, et al.
Publicado: (2022)

On cuts of small chromatic number in sparse graphs
por: Aubian, Guillaume, et al.
Publicado: (2025)

More results on the $z$-chromatic number of graphs
por: Khaleghi, Abbas, et al.
Publicado: (2023)

Palette Sparsification for Graphs with Sparse Neighborhoods
por: Dhawan, Abhishek
Publicado: (2024)

Packing chromatic critical graphs with radius at most 2
por: Gür, Aslıhan, et al.
Publicado: (2026)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
por: Das, Sandip, et al.
Publicado: (2023)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
por: Bencs, Ferenc, et al.
Publicado: (2025)

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

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, et al.
Publicado: (2024)

Three-chromatic geometric hypergraphs
por: Damásdi, Gábor, et al.
Publicado: (2021)

($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
por: Angeliya, C. U., et al.
Publicado: (2025)

Linear versus centred chromatic numbers
por: Bose, Prosenjit, et al.
Publicado: (2022)

Burling graphs in graphs with large chromatic number
por: Abrishami, Tara, et al.
Publicado: (2025)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
por: Chakraborty, Dibyayan
Publicado: (2025)

Fast algorithms for Vizing's theorem on bounded degree graphs
por: Bernshteyn, Anton, et al.
Publicado: (2023)

Vertex-critical graphs in co-gem-free graphs
por: Beaton, Iain, et al.
Publicado: (2024)

Balanced-chromatic number and Hadwiger-like conjectures
por: Jiménez, Andrea, et al.
Publicado: (2023)

$θ$-free matching covered graphs
por: Joshi, Rohinee, et al.
Publicado: (2024)

Coloring bridge-free antiprismatic graphs
por: Robin, Cléophée, et al.
Publicado: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
por: de Lima, Paloma T., et al.
Publicado: (2025)

Bounding the chromatic number of dense digraphs by arc neighborhoods
por: Klingelhoefer, Felix, et al.
Publicado: (2023)

The sandwich problem for odd-hole-free and even-hole-free graphs
por: Cameron, Kathie, et al.
Publicado: (2024)

Computing fixed point free automorphisms of graphs
por: Abiad, Aida, et al.
Publicado: (2026)

Nucleation-free independent graphs with implied nonedges
por: Cheng, Jialong, et al.
Publicado: (2025)

Secure domination in $P_5$-free graphs
por: Gupta, Uttam K., et al.
Publicado: (2025)

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

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

A new vertex coloring heuristic and corresponding chromatic number
por: Zaker, Manouchehr
Publicado: (2020)

On acyclic b-chromatic number of cubic graphs
por: Anholcer, Marcin, et al.
Publicado: (2025)

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
por: Ghasemi, Fatemeh, et al.
Publicado: (2025)