Imagen de Portada

List colorings of $k$-partite $k$-graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Dhawan, Abhishek
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics
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)

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

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

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

Bounds for the independence and chromatic numbers of locally sparse graphs
por: Dhawan, Abhishek
Publicado: (2024)

List-$k$-Coloring $H$-free graphs for all $k>4$
por: Chudnovsky, Maria, et al.
Publicado: (2023)

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

On $k$-colorability of $(bull, H)$-free graphs
por: Hodur, Nadzieja, et al.
Publicado: (2025)

Transversal tilings in k-partite graphs without large holes
por: He, Xinyu, et al.
Publicado: (2026)

Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
por: Lo, Allan, et al.
Publicado: (2023)

On the critical group of the k-partite graph
por: Dong, Xinyu, et al.
Publicado: (2024)

Inequalities for $k$-regular partitions
por: Heim, Bernhard, et al.
Publicado: (2024)

Coloring locally sparse graphs
por: Anderson, James, et al.
Publicado: (2024)

Coloring graphs with forbidden almost bipartite subgraphs
por: Anderson, James, et al.
Publicado: (2022)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, 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)

Intersection theorems for families of matchings of complete $k$-partite $k$-graphs
por: Mammoliti, Adam
Publicado: (2018)

Hall numbers of some complete $k-$partite graphs
por: Allagan, Julian A.
Publicado: (2026)

$C_{2k+1}$-coloring of bounded-diameter graphs
por: Piecyk, Marta
Publicado: (2024)

Tilings in quasi-random $k$-partite hypergraphs
por: Sun, Shumin
Publicado: (2023)

Generalizations of Euler's Theorem to $k$-regular partitions
por: Lin, Hongshu, et al.
Publicado: (2025)

Fast and Simple $(1+ε)Δ$-Edge-Coloring of Dense Graphs
por: Dhawan, Abhishek
Publicado: (2024)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
por: Dhawan, Abhishek
Publicado: (2024)

On the perfect $k$-divisibility of graphs
por: Scholz, David
Publicado: (2025)

Monochromatic $k$-connection of graphs
por: Cai, Qingqiong, et al.
Publicado: (2024)

The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
por: Ahn, Jungho, et al.
Publicado: (2022)

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

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

Odd coloring of $k$-trees
por: Kashima, Masaki, et al.
Publicado: (2025)

The strong chromatic index of $K_{t,t}$-free graphs
por: Bi, Richard, et al.
Publicado: (2026)

$k$-tuple domination on Kneser graphs
por: Cornet, María Gracia, et al.
Publicado: (2023)

The $k$-representation number of the random graph
por: Basu, Ayush, et al.
Publicado: (2024)

On the mod $k$ chromatic index of graphs
por: Nweit, Oothan, et al.
Publicado: (2024)

Non-bipartite k-common graphs
por: Kral, Daniel, et al.
Publicado: (2020)

Edge-coloring $K_{n, n}$ with no 2-colored $C_{2k}$
por: Bal, Deepak, et al.
Publicado: (2025)

A proposed crank for $(k+j)$-colored partitions, with $j$ colors having distinct parts
por: Wilson, Samuel
Publicado: (2024)

On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs
por: Pereyra, Kevin
Publicado: (2026)

Color $2$-switches and neighborhood $λ$-balanced graphs with $k$ colors
por: Collins, Karen L., et al.
Publicado: (2026)

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
por: Zhong, Jiaxu, et al.
Publicado: (2026)

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