Cover Image

Strong edge-coloring of sparse graphs with Ore-degree 7 or 8

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wang, Runze
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 05C15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Strong edge-coloring of graphs with maximum edge weight seven
by: Wang, Runze
Published: (2025)

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

A biased edge coloring game
by: Wang, Runze
Published: (2024)

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

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

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

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

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

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

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

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

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

Degree-choosability of proper conflict-free list coloring of sparse graphs
by: Kashima, Masaki, et al.
Published: (2026)

Genetic algorithm and edge-colorings of complete graphs with connected classes
by: Cervantes-Ojeda, Jorge, et al.
Published: (2024)

Normal 6-edge-colorings of cubic graphs with oddness 2
by: Fabrici, Igor, et al.
Published: (2025)

2-distance 20-coloring of planar graphs with maximum degree 6
by: Aoki, Kengo
Published: (2024)

Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable
by: Hou, Jingxi, et al.
Published: (2025)

Flexible list coloring of graphs with maximum average degree less than $3$
by: Bi, Richard, et al.
Published: (2023)

On 2-distance 16-coloring of planar graphs with maximum degree at most five
by: Deniz, Zakir
Published: (2023)

Vertex-partitions of 2-edge-colored graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

The wild number of an edge-colored graph
by: Anders, Katie, et al.
Published: (2025)

Asymptotic number of edge-colored regular graphs
by: Borinsky, Michael, et al.
Published: (2026)

Backbone coloring for graphs with degree 4
by: Michalik, Krzysztof, et al.
Published: (2024)

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

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

Tight minimum colored degree condition for rainbow connectivity
by: Czygrinow, Andrzej, et al.
Published: (2024)

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

Total coloring of regular graphs of girth = degree + 1
by: Dejter, Italo J.
Published: (2024)

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

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

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

The edge chromatic transformation index of graphs
by: Asratian, Armen S., et al.
Published: (2025)

Coloring small locally sparse degenerate graphs and related problems
by: Bradač, Domagoj, 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)

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

A note on transformations of edge colorings of chordless graphs and triangle-free graphs
by: Asratian, Armen
Published: (2024)

Regular graphs are universally 3-edge-weightable
by: Deng, Kecai
Published: (2026)

Normal 5-edge-coloring of some snarks superpositioned by Flower snarks
by: Sedlar, Jelena, et al.
Published: (2023)

Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)

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