Cover Image

On Alon-Tarsi orientations of sparse graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cho, Eun-Kyung, Choi, Ilkyoo, Park, Boram, Zhu, Xuding
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Obstructions for homomorphisms to odd cycles in series-parallel graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)

Tight bound for independent domination of cubic graphs without $4$-cycles
by: Cho, Eun-Kyung, et al.
Published: (2021)

Brooks-type theorems for relaxations of square colorings
by: Cho, Eun-Kyung, et al.
Published: (2023)

Between proper and square colorings of sparse graphs
by: Choi, Ilkyoo, et al.
Published: (2025)

Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4
by: Cho, Eun-Kyung, et al.
Published: (2022)

An Alon-Tarsi Style Theorem for Additive Colorings
by: Gossett, Ian
Published: (2023)

Alon-Tarsi for hypergraphs
by: Anholcer, Marcin, et al.
Published: (2024)

Existence of cycles of length divisible by 3 or 4
by: Choi, Ilkyoo, et al.
Published: (2026)

Truncated degree AT-orientations of outerplanar graphs
by: Deng, Chenglong, et al.
Published: (2024)

On the Alon-Tarsi Number of Some Line and Total graphs
by: Prajnanaswaroopa, S.
Published: (2023)

Strong odd coloring of sparse graphs
by: Kwon, Hyemin, et al.
Published: (2024)

On a group ring identity related to the Alon-Jaeger-Tarsi conjecture
by: Nagy, János, et al.
Published: (2026)

The degeneracy and Alon-Tarsi number under $F$-sum operations
by: Li, Zhiguo, et al.
Published: (2026)

Cubic graphs of colouring defect 3 and conjectures of Berge and Alon-Tarsi
by: Karabáš, Ján, et al.
Published: (2025)

Arc weighted acyclic orientations and variations of degeneracy of graphs
by: Zhou, Huan, et al.
Published: (2023)

$2$-limited broadcast domination in cubic graphs
by: Choi, Myungho, et al.
Published: (2026)

Alon-Tarsi Number of Some Regular Graphs
by: Prajnanaswaroopa, S.
Published: (2023)

The Alon-Tarsi Number of Cartesian product and Corona product of Hypercube Graph and Special Graphs
by: Li, Zhiguo, et al.
Published: (2025)

Minimum non-chromatic-choosable graphs with given chromatic number
by: Zhu, Jialu, et al.
Published: (2022)

Odd 4-coloring of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2024)

List colouring triangle free planar graphs
by: Hu, Jianzhang, et al.
Published: (2019)

Degree-truncated choosability of graphs
by: Zhou, Huan, et al.
Published: (2025)

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

Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
by: Xu, Xiaoyan, et al.
Published: (2025)

Tight upper bounds on the hop domination number of triangle-free graphs
by: Fujita, Shinya, et al.
Published: (2025)

Characterization of cycle obstruction sets for improper coloring planar graphs
by: Choi, Ilkyoo, et al.
Published: (2018)

A survey on Hedetniemi's conjecture
by: Zhu, Xuding
Published: (2025)

List packing of graphs with bounded tree-width
by: Kashima, Masaki, et al.
Published: (2026)

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$
by: Chu, Hojin, et al.
Published: (2025)

Degree-truncated choosability of planar graphs
by: Jiang, Yiting, et al.
Published: (2024)

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

Indicated list colouring game on graphs
by: Gu, Yangyan, et al.
Published: (2025)

Connectivity keeping trees in triangle-free graphs
by: Chu, Hojin, et al.
Published: (2025)

Bound on shortest cycle covers
by: Song, Deping, et al.
Published: (2024)

Partition of Sparse Multigraphs into a Forest and a Forest with Restrictions
by: Choi, Ilkyoo, et al.
Published: (2025)

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

Truncated degree DP-colourability of $K_{2,4}$-minor free graphs
by: Lo, On-Hei Solomon, et al.
Published: (2023)

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
by: Jin, Ligang, et al.
Published: (2024)

On 2-connected graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2026)

Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
by: Kuffner, Luis, et al.
Published: (2024)