Edge $k$-$q$-Colorability of Graphs (Q4637664): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path decompositions of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the sum of squares of degrees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the theory of regular graphs of third and fourth degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-max Edge q-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Min-Max Edge q-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5539649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Factors and Antifactor Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm / rank
 
Normal rank

Latest revision as of 14:13, 15 July 2024

scientific article; zbMATH DE number 6864493
Language Label Description Also known as
English
Edge $k$-$q$-Colorability of Graphs
scientific article; zbMATH DE number 6864493

    Statements