Pages that link to "Item:Q1107328"

From MaRDI portal

← Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328)

Jump to:navigation, search

The following pages link to Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328):

Displaying 3 items.

Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (Q1195493) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q1107328"