Cover Image

Relaxation of Wegner's Planar Graph Conjecture for maximum degree 4

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cho, Eun-Kyung, Choi, Ilkyoo, Lidický, Bernard
Format:	Preprint
Published:	2022
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

On Alon-Tarsi orientations of sparse graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)

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

Local maximum of inducibility profiles
by: Balogh, József, et al.
Published: (2026)

On Wegner's 8-Coloring Theorem for Planar Graphs of Maximum Degree Three
by: Elvin, Gabriel, et al.
Published: (2025)

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

10 Problems for Partitions of Triangle-free Graphs
by: Balogh, József, et al.
Published: (2022)

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

Positive co-degree densities and jumps
by: Balogh, József, et al.
Published: (2024)

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

On a conjecture concerning 4-coloring of graphs with one crossing
by: Dvořák, Zdeněk, et al.
Published: (2025)

$C_5$ is almost a fractalizer
by: Lidický, Bernard, et al.
Published: (2021)

Weighted Turán theorems with applications to Ramsey-Turán type of problems
by: Balogh, József, et al.
Published: (2023)

The Spectrum of Triangle-free Graphs
by: Balogh, József, et al.
Published: (2022)

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

Hypergraph Turán Problems in $\ell_2$-Norm
by: Balogh, József, et al.
Published: (2021)

Proper Rainbow Saturation Numbers for Cycles
by: Halfpap, Anastasia, et al.
Published: (2024)

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

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

Planar Graphs with Ore-degree at Most seven is strongly $13$-edge-colorable
by: Nelson, Seth, et al.
Published: (2025)

Three Theorems on Negami's Planar Cover Conjecture
by: Annor, Dickson, et al.
Published: (2024)

On the maximum $σ$-irregularity of trees with given order and maximum degree
by: Bašić, Milan
Published: (2026)

Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers
by: Brosch, Daniel, et al.
Published: (2025)

The Hypergraph Turán Densities of Tight Cycles Minus an Edge
by: Lidicky, Bernard, et al.
Published: (2024)

Hypergraph independence bounds: from maximum degree to average degree
by: Yu, Jing, et al.
Published: (2026)

Majority additive coloring and the maximum degree
by: Brause, Christoph, et al.
Published: (2025)

Decomposing random regular graphs into stars
by: Delcourt, Michelle, et al.
Published: (2023)

Semi-Inducibility of some small graphs
by: Balogh, József, et al.
Published: (2026)

Sidorenko property and forcing in regular tournaments
by: Král', Daniel, et al.
Published: (2026)

Small Ramsey numbers for books, wheels, and generalizations
by: Lidický, Bernard, et al.
Published: (2024)

Antimagic labelling of graphs with maximum degree $Δ(G) = n - 4$
by: Beaudoire, Grégoire, et al.
Published: (2026)

Injective edge-coloring of claw-free graphs with maximum degree 4
by: Huang, Danjun, et al.
Published: (2025)

Planar graphs with the maximum number of induced 6-cycles
by: Savery, Michael
Published: (2021)

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

Nonregular graphs with a given maximum degree attaining maximum spectral radius
by: Huang, Zejun, et al.
Published: (2024)

Graphs of maximum average degree less than $\frac {11}{3}$ are flexibly $4$-choosable
by: Bi, Richard, et al.
Published: (2024)

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

Embedding trees using minimum and maximum degree conditions
by: Pokrovskiy, Alexey, et al.
Published: (2025)

Feedback vertex sets of digraphs with bounded maximum degree
by: Ai, Jiangdong, et al.
Published: (2025)