Chromatic index of dense quasirandom graphs
From MaRDI portal
Publication:2171027
DOI10.1016/j.jctb.2022.08.001zbMath1497.05100arXiv2104.06253OpenAlexW4292771434MaRDI QIDQ2171027
Publication date: 23 September 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.06253
Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Cites Work
- A constructive proof of Vizing's theorem
- Overfull conjecture for graphs with high minimum degree
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- The NP-Completeness of Edge-Coloring
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Independent sets and 2‐factors in edge‐chromatic‐critical graphs
- An Asymptotic Version of the Multigraph 1‐Factorization Conjecture
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- The Solution of a Timetabling Problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Optimal path and cycle decompositions of dense quasirandom graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Chromatic index of dense quasirandom graphs