A brief history of edge-colorings – with personal reminiscences
From MaRDI portal
Publication:5862696
DOI10.47443/dml.2021.s105zbMath1499.05001OpenAlexW3124611360MaRDI QIDQ5862696
No author found.
Publication date: 9 March 2022
Published in: Discrete Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.47443/dml.2021.s105
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a limit of the method of Tashkinov trees for edge-colouring
- On the chromatic index of multigraphs without large triangles
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- List-colourings of graphs
- Construction of class two graphs with maximum vertex degree three
- On small graphs critical with respect to edge colourings
- On the chromatic index of almost all graphs
- Graph edge coloring: a survey
- Hadwiger's conjecture for line graphs
- The list chromatic index of a bipartite multigraph
- Some remarks on the chromatic index of a graph
- On the edge-chromatic number of a graph
- Edge-coloring of multigraphs: Recoloring technique
- On the $1.1$ Edge-Coloring of Multigraphs
- The NP-Completeness of Edge-Coloring
- On the chromatic index and the cover index of a multigraph
- On edge-colorings of graphs.
- A bibliographic survey of edge‐colorings
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- A Theorem on Coloring the Lines of a Network
This page was built for publication: A brief history of edge-colorings – with personal reminiscences
