Cover Image

On a conjecture concerning 4-coloring of graphs with one crossing

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dvořák, Zdeněk, Lidický, Bernard, Mohar, Bojan
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

On Borodin-Kostochka conjecture for correspondence coloring
by: Dvořák, Zdeněk, et al.
Published: (2026)

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

Bipartite graphs are $(\frac{4}{5}-\varepsilon) \fracΔ{\log Δ}$-choosable
by: Bradshaw, Peter, et al.
Published: (2024)

A note on extendable sets of colorings and rooted minors
by: Dvořák, Zdeněk, 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)

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

11/4-colorability of subcubic triangle-free graphs
by: Dvořák, Zdeněk, et al.
Published: (2022)

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

Counterexamples to two conjectures on mean color numbers of graphs
by: Zhai, Wushuang, et al.
Published: (2024)

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

Towards Characterization of 5-List-Colorability of Toroidal Graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)

Sparsity of 3-flow critical graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)

On a problem concerning integer distance graphs
by: Oravcová, Janka, et al.
Published: (2024)

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

Strong majority colorings of graphs
by: Kalinowski, Rafał, et al.
Published: (2026)

Counting subgraphs of coloring graphs
by: Asgarli, Shamil, et al.
Published: (2024)

On the interval coloring impropriety of graphs
by: Carr, MacKenzie, et al.
Published: (2023)

On odd colorings of sparse graphs
by: Wang, Tao, et al.
Published: (2022)

Reconfiguration graph for vertex colorings for ($P_2$+$P_3$, $C_4$)-free graphs
by: Belavadi, M., et al.
Published: (2025)

Maximum odd induced subgraph of a graph concerning its chromatic number
by: Wang, Tao, et al.
Published: (2022)

Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
by: Fang, Shu, et al.
Published: (2026)

Equitable list coloring of sparse graphs
by: Kierstead, H. A., et al.
Published: (2024)

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

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

The DP-coloring of the square of subcubic graphs
by: Zhao, Ren
Published: (2024)

Reconfiguration graphs for vertex colorings of $P_5$-free graphs
by: Lei, Hui, et al.
Published: (2024)

Density of rainbow triangles and properly colored $K_4$'s
by: Balogh, József, et al.
Published: (2025)

Injective (edge) colorings of generalized Sierpiński graphs
by: Bhanupriya, C. K., et al.
Published: (2025)

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

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

Star edge coloring of generalized Petersen graphs
by: Dastjerdi, Behnaz Omoomi Marzieh Vahid
Published: (2024)

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

Injective coloring of product graphs
by: Samadi, Babak, et al.
Published: (2023)

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

Injective colorings of Sierpiński-like graphs and Kneser graphs
by: Brešar, Boštjan, et al.
Published: (2024)

An Erdos-Gallai conjecture for signed graphs
by: Wang, Lujia
Published: (2025)

Interval edge-colorings of Cartesian products of graphs II
by: Petrosyan, Petros A., et al.
Published: (2024)

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

Results on proper conflict-free list coloring of graphs
by: Kashima, Masaki, et al.
Published: (2025)