Edge coloring
In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color.
Edge coloringList edge-coloringGraph coloringTotal coloringCubic graphBipartite graphList coloringMatching (graph theory)Thue numberShannon multigraphGraph theoryPetersen graphOdd graphTait's conjectureGraph factorizationContinuous graphErdős–Faber–Lovász conjectureFractional coloringList of graph theory topicsOuterplanar graph
Domatic numberCycle double coverJon FolkmanRado graphAperiodic graphTrace diagramPenrose tilingHorton graphGlossodoris cinctaGallery of named graphsAlmost surelyOpen shop schedulingOverfull graphRoad coloring problemGraph (mathematics)Vadim G. VizingIris fernaldiiComplete coloringMoser spindlePurple fringing
Share this!