✦ LIBER ✦

A dirac-type theorem for squares of graphs

✍ Scribed by Tomasz Traczyk Jr.

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 221 KB
Volume: 12
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190120402

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that if G is a connected graph with p vertices and minimum degree greater than max( p/4 -1,3) then G2 is pancyclic. The result is best possible of its kind.

📜 SIMILAR VOLUMES

Topological subgraphs of cubic graphs an

Topological subgraphs of cubic graphs and a theorem of dirac

✍ Richard Statman 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 339 KB

## Abstract The topological subgraph relation between cubic graphs is analyzed. The analysis is then applied to generalize a theorem of Dirac.

A Generalization of a Theorem of Dirac

✍ Tristan Denley; Haidong Wu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 85 KB

In this paper, we give a generalization of a well-known result of Dirac that given any k vertices in a k-connected graph where k 2, there is a circuit containing all of them. We also generalize a result of Ha ggkvist and Thomassen. Our main result partially answers an open matroid question of Oxley.

Ramsey-Type Theorems for Spatial Graphs

Ramsey-Type Theorems for Spatial Graphs and Good Drawings

✍ Seiya Negami 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 336 KB

We shall prove that for any spatial graph H, there exists a pair of natural numbers (N, M) such that any spatial embedding of the complete bipartite graph K N, M whose projection is a good drawing on the plane contains a subgraph which is ambient isotopic to a subdivision of H. ## 1998 Academic Pre

A product theorem for row-complete Latin

A product theorem for row-complete Latin squares

✍ Jeff Higham 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

In this article it is shown how to construct a row-complete latin square of order mn, given one of order m and given a sequencing of a group of order n. This yields infinitely many new orders for which row-complete latin squares can be constructed.

A list version of Dirac's theorem on the

A list version of Dirac's theorem on the number of edges in colour-critical graphs

✍ Alexandr V. Kostochka; Michael Stiebitz 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB 👁 2 views

## Abstract One of the basic results in graph colouring is Brooks' theorem [R. L. Brooks, Proc Cambridge Phil Soc 37 (1941) 194–197], which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension o

An L2-Index Theorem for Dirac Operators

An L2-Index Theorem for Dirac Operators on S1×R3

✍ Tom M.W. Nye; Michael A. Singer 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 178 KB

An expression is found for the L 2 -index of a Dirac operator coupled to a connection on a U n vector bundle over S 1 \_R 3 . Boundary conditions for the connection are given which ensure the coupled Dirac operator Fredholm. Callias' index theorem is used to calculate the index when the connection i