Cover Image

Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kidner, Arnott, Steffen, Eckhard, Yu, Weiqiang
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

Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
by: Ma, Yulai, et al.
Published: (2022)

A dichotomy theorem for $Γ$-switchable $H$-colouring on $m$-edge coloured graphs
by: Brewster, Richard, et al.
Published: (2023)

Eulerian-minors and a concise recursive characterization of 4-regular planar graphs
by: Metsidik, Metrose, et al.
Published: (2024)

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

Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
by: Hou, Xinmin, et al.
Published: (2026)

Extending total colorings in planar graphs
by: Henderschedt, Owen, et al.
Published: (2025)

Equitable coloring of graphs beyond planarity
by: Liu, Weichan
Published: (2025)

Note on robust coloring of planar graphs
by: Kardoš, František, et al.
Published: (2024)

Defective correspondence coloring of planar graphs
by: Anderson, James
Published: (2024)

Semistrong edge colorings of planar graphs
by: Lin, Yuquan, et al.
Published: (2024)

The interval coloring impropriety of planar graphs
by: Lee, Seunghun
Published: (2024)

Proper edge colorings of planar graphs with rainbow $C_4$-s
by: Gyárfás, András, et al.
Published: (2024)

Subcubic $K_4$-minor-free graphs without crumby colorings
by: Pintér, József
Published: (2026)

Generalized Petersen graphs are (1,3)-choosable
by: Tang, Yunfang, et al.
Published: (2024)

On $\{1,2\}$-distance-balancedness of generalized Petersen graphs
by: Ma, Gang, et al.
Published: (2024)

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Some conjectures on $r$-graphs and equivalences
by: Ma, Yulai, et al.
Published: (2024)

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

Every graph with no $K_7^{\vee}$-minor is $6$-colorable
by: Norin, Sergey, et al.
Published: (2025)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

A note on $\bar{X}$-coloring and $\hat{A}$-coloring 4-regular graphs
by: Jooken, Jorik
Published: (2024)

Classification of perfect and total perfect codes in generalized Petersen graphs
by: Wang, Xiaomeng, et al.
Published: (2026)

Hoffman colorability of (strongly) regular graphs
by: Abiad, Aida, et al.
Published: (2025)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs
by: Anderson, James, et al.
Published: (2024)

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

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)

Between proper and square coloring of planar graphs, hardness and extremal graphs
by: Delépine, Thomas
Published: (2026)

Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
by: Wang, Yichen, et al.
Published: (2024)

A 2-distance $(2Δ+7)$-coloring of planar graphs
by: Deniz, Zakir
Published: (2024)

Defective coloring is perfect for minors
by: Liu, Chun-Hung
Published: (2022)

The net-regular strongly regular signed graphs with degree 5
by: Yu, Qian, et al.
Published: (2025)

Between proper and square colorings of planar graphs with maximum degree at most four
by: Liu, Xujun, et al.
Published: (2026)

On the number of Hamiltonian cycles in the generalized Petersen graph
by: Haugland, Jan Kristian
Published: (2025)

Links in projective planar graphs
by: Foisy, Joel, et al.
Published: (2022)

Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs
by: Gao, Yuping, et al.
Published: (2024)

Cospectral vertices, walk-regular planar graphs and the echolocation problem
by: Kong, Shi-Lei, et al.
Published: (2024)

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
by: Deniz, Zakir, et al.
Published: (2025)

On the maximum spectral radius of planar graphs
by: Yu, Guanglong, et al.
Published: (2025)

Edge-spectral Turán theorems for color-critical graphs with applications
by: Li, Yongtao, et al.
Published: (2025)