scientific article; zbMATH DE number 1560509
From MaRDI portal
Publication:4527280
zbMATH Open0955.05036MaRDI QIDQ4527280FDOQ4527280
Authors: V. A. Tashkinov 
Publication date: 4 February 2001
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)
Cited In (27)
- Edge-colorings of some large graphs on alphabets
- On the $1.1$ Edge-Coloring of Multigraphs
- An asymptotic approximation scheme for multigraph edge coloring
- Chromatic index determined by fractional chromatic index
- A combined logarithmic bound on the chromatic index of multigraphs
- Densities, matchings, and fractional edge-colorings
- On resolving edge colorings in graphs
- Goldberg's conjecture is true for random multigraphs
- Edge coloring multigraphs without small dense subsets
- On a limit of the method of Tashkinov trees for edge-colouring
- Double Vizing fans in critical class two graphs
- On edge orienting methods for graph coloring
- Vizing's coloring algorithm and the fan number
- On characterizing Vizing's edge colouring bound
- Kempe classes and almost bipartite graphs
- A brief history of edge-colorings -- with personal reminiscences
- Average degrees of edge-chromatic critical graphs
- Tashkinov-trees: an annotated proof
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- Achieving maximum chromatic index in multigraphs
- On a theorem of Goldberg
- Approximating the chromatic index of multigraphs
- Structural properties of edge-chromatic critical multigraphs
- Title not available (Why is that?)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- On Vizing's bound for the chromatic index of a multigraph
- Graph edge coloring: a survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527280)
