✦ LIBER ✦

Further results on graph equations for line graphs and n-th power graphs

✍ Scribed by Jin Akiyama; Hiroshi Era; Geoffrey Exoo

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 913 KB
Volume: 34
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90001-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph equations for line graphs and tota

Graph equations for line graphs and total graphs

✍ Dragǒs M. Cvetković; Slobodan K. Simić 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Graph equations for line graphs, total g

Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs

✍ D.V.S Sastry; B.Syam Prasad Raju 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Further results on snakes in powers of c

Further results on snakes in powers of complete graphs

✍ H.L. Abbott; M. Katchalski 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Abbott, H.L. and M. Katchalski, Further results on snakes in powers of complete graphs, Discrete Mathematics 91 (1991) 111-120. By a snake in a finite graph G is meant a cycle without chords. Denoted by S(G) the length of a longest snake in G. In this paper we obtain a new lower bound for S(G) in t

Algorithms for Page Retrieval and Hamilt

Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs

✍ T.H. Lai; S.S. Wei 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 706 KB

On Dense Bipartite Graphs of Girth Eight

On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point–Line Systems

✍ D de Caen; L.A Székely 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 956 KB

In earlier work we showed that if G(m, n) is a bipartite graph with no 4-cycles or 6-cycles, and if m<c 1 n 2 and n<c 2 m 2 , then the number of edges e is O((mn) 2Â3 ). Here we give a more streamlined proof, obtaining some sharp results; for example, if G has minimum degree at least two then e 3 -