Edge $k$-$q$-Colorability of Graphs
From MaRDI portal
Publication:4637664
DOI10.7155/jgaa.00464zbMath1384.05085OpenAlexW2789277117MaRDI QIDQ4637664
Mekkia Kouider, Selma Djelloul, Odile Favaron
Publication date: 25 April 2018
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00464
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- An upper bound on the sum of squares of degrees in a graph
- The Min-max Edge q-Coloring Problem
- The Min-Max Edge q-Coloring Problem
- From the theory of regular graphs of third and fourth degree
- Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
- 1-Factors and Antifactor Sets
- Path decompositions of multigraphs