Sökning: "interval edge coloring"
Hittade 1 uppsats innehållade orden interval edge coloring.
1. One-sided interval edge-colorings of bipartite graphs
Kandidat-uppsats, Linköpings universitet/Matematik och tillämpad matematik; Linköpings universitet/Tekniska fakultetenSammanfattning : A graph is an ordered pair composed by a set of vertices and a set of edges, the latter consisting of unordered pairs of vertices. Two vertices in such a pair are each others neighbors. Two edges are adjacent if they share a common vertex. Denote the amount of edges that share a specific vertex as the degree of the vertex. LÄS MER
Resultatsidor:
1