Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Interval edge coloring (view), Misra & Gries edge coloring algorithm (view)

searching for Edge coloring 20 found (77 total)

Monochromatic triangle (475 words) [view diff] exact match in snippet view article find links to article

of triangle-free edge-coloring when there are exactly two colors available. If there exists a two-color triangle-free edge coloring, then the edges of

Petersen graph (2,926 words) [view diff] no match in snippet view article find links to article

constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact

Rhombitriapeirogonal tiling (215 words) [view diff] no match in snippet view article find links to article

uniform coloring. Similar to the Euclidean rhombitrihexagonal tiling, by edge-coloring there is a half symmetry form (3*∞) orbifold notation. The apeireogons

Rhombitrioctagonal tiling (339 words) [view diff] no match in snippet view article find links to article

uniform coloring. Similar to the Euclidean rhombitrihexagonal tiling, by edge-coloring there is a half symmetry form (3*4) orbifold notation. The octagons

Outerplanar graph (2,034 words) [view diff] exact match in snippet view article find links to article

maximum degree except when the graph forms a cycle of odd length. An edge coloring with an optimal number of colors can be found in linear time based on

Rhombitrihexagonal tiling (928 words) [view diff] exact match in snippet view article find links to article

snub triangular Snub triangular Image Uniform face coloring Uniform edge coloring Nonuniform geometry Limit Schläfli symbol rr{3,6} s2{3,6} s{3,6} Coxeter

Graph property (1,170 words) [view diff] exact match in snippet view article find links to article

Chromatic index, the smallest number of colors for the edges in a proper edge coloring Choosability (or list chromatic number), the least number k such that

Aperiodic graph (607 words) [view diff] exact match in snippet view article find links to article

in which all vertices have the same outdegree has a synchronizable edge coloring if and only if it is aperiodic. Jarvis, J. P.; Shier, D. R. (1996),

Almost surely (1,423 words) [view diff] case mismatch in snippet view article find links to article

Threshold for Random Graphs with a Monochromatic Triangle in Every Edge Coloring". Memoirs of the American Mathematical Society. 179 (845). AMS Bookstore:

List coloring (1,613 words) [view diff] no match in snippet view article find links to article

assignment. Look up choosability in Wiktionary, the free dictionary. List edge-coloring Jensen, Tommy R.; Toft, Bjarne (1995), "1.9 List coloring", Graph coloring

Jon Folkman (1,126 words) [view diff] exact match in snippet view article find links to article

J. (1970), "Graphs with monochromatic complete subgraphs in every edge coloring", SIAM Journal on Applied Mathematics, 18: 19–24, doi:10.1137/0118004

Rainbow-independent set (2,703 words) [view diff] no match in snippet view article find links to article

of G is a matching in H. The vertex-coloring of G corresponds to an edge-coloring of H, and a rainbow-independent-set in G corresponds to a rainbow-matching

Thue number (714 words) [view diff] exact match in snippet view article find links to article

MR 2433774. Manin, Fedor (2007). "The complexity of nonrepetitive edge coloring of graphs". arXiv:0709.4497. Bibcode:2007arXiv0709.4497M. {{cite journal}}:

Kotzig's theorem (431 words) [view diff] exact match in snippet view article find links to article

O. V. (1990), "A generalization of Kotzig's theorem and prescribed edge coloring of planar graphs", Matematicheskie Zametki, 48 (6): 22–28, 160, doi:10

Jeannette Janssen (443 words) [view diff] no match in snippet view article find links to article

be extended to a full rectangle. The problem is equivalent to list edge-coloring of complete bipartite graphs, and her solution was based on earlier

Degeneracy (graph theory) (3,393 words) [view diff] no match in snippet view article

a graph G to the Ramsey number of G, the least n such that any two-edge-coloring of an n-vertex complete graph must contain a monochromatic copy of G

Unavoidable pattern (2,726 words) [view diff] exact match in snippet view article find links to article

{*}{\rightarrow }}w}. Given a simple graph G=(V,E){\displaystyle G=(V,E)}, a edge coloring c:E→Δ{\displaystyle c:E\rightarrow \Delta } matches pattern p{\displaystyle

Ramsey's theorem (7,887 words) [view diff] exact match in snippet view article find links to article

contains an induced monochromatic copy of every graph on k vertices in any edge coloring in two colors. Currently, Erdős's conjecture that rind(H) ≤ 2ck remains

Two-tree broadcast (1,968 words) [view diff] exact match in snippet view article find links to article

Two-tree broadcast with seven processors, including the edge coloring. T1 in red, T2 in blue. The last processor is the root.

Rook's graph (3,769 words) [view diff] no match in snippet view article find links to article

164.51, JSTOR 20159988, S2CID 119151552. For the equivalence between edge-coloring complete bipartite graphs and Latin squares, see e.g. LeSaulnier, Timothy