𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Color-critical graphs and hypergraphs with few edges and no short cycles

✍ Scribed by H.L. Abbott; D.R. Hare; B. Zhou

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
378 KB
Volume
182
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We give constructions of color-critical graphs and hypergraphs with no cycles of length 5 or shorter and with relatively few edges.

📜 SIMILAR VOLUMES

Sparse color-critical graphs and hypergr
Sparse color-critical graphs and hypergraphs with no short cycles
✍ H. L. Abbott; B. Zhou; D. R. Hare 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 709 KB

## Abstract We give constructions of color‐critical graphs and hypergraphs with no short cycles and with relatively few edges. In particular, we show that, for each __n__ ≧ 3, the smallest number of edges in a 3‐critical triangle‐free __n__‐graph (hypergraph) with __m__ vertices is __m__ + __o(m)__

Cycles and paths in edge-colored graphs
Cycles and paths in edge-colored graphs with given degrees
✍ A. Abouelaoualim,; K. Ch. Das; W. Fernandez de la Vega; M. Karpinski; Y. Manouss 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB 👁 1 views

## Abstract Sufficient degree conditions for the existence of properly edge‐colored cycles and paths in edge‐colored graphs, multigraphs and random graphs are investigated. In particular, we prove that an edge‐colored multigraph of order __n__ on at least three colors and with minimum colored degre