✦ LIBER ✦

Edges without crossings in drawings of complete graphs

✍ Scribed by Heiko Harborth; Ingrid Mengersen

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 595 KB
Volume: 17
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90035-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge colorings of complete graphs withou

Edge colorings of complete graphs without tricolored triangles

✍ András Gyárfás; Gábor Simony 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 59 KB

## Abstract We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the existence of special monochromatic spanning trees in such colorings. We also determine the size

Edge domination in complete partite grap

Edge domination in complete partite graphs

✍ Bor-Liang Chen; Hung-Lin Fu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 416 KB

An edge dominating set in a graph G is a set of edges D such that every edge not in D is adjacent to an edge of D. An edge domatic partition of a graph C=(V, E) is a collection of pairwise-disjoint edge dominating sets of G whose union is E. The maximum size of an edge domatic partition of G is call

Decompositions of Edge-Colored Complete

Decompositions of Edge-Colored Complete Graphs

✍ Esther R. Lamken; Richard M. Wilson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We prove an asymptotic existence theorem for decompositions of edge-colored complete graphs into prespecified edge-colored subgraphs. Many combinatorial design problems fall within this framework. Applications of our main theorem require calculations involving the numbers of edges of each color and

Coloring the Edges of a Complete Graph

✍ Annamaria G. Varga 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

2-Colored triangles in edge-colored comp

2-Colored triangles in edge-colored complete graphs

✍ D.T Busolini 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 82 KB

Edge disjoint Steiner trees in graphs wi

Edge disjoint Steiner trees in graphs without large bridges

✍ Matthias Kriesell 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract A set __A__ of vertices of an undirected graph __G__ is called __k__‐__edge‐connected in G__ if for all pairs of distinct vertices __a, b__∈__A__, there exist __k__ edge disjoint __a, b__‐paths in __G__. An __A__‐__tree__ is a subtree of __G__ containing __A__, and an __A__‐__bridge__ i