On a Modified Concept of Thickness of a Graph

On the toroidal thickness of graphs

✍ Ian Anderson 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 297 KB

A new concept of primeness in graphs

✍ R. H. Lamprey; B. H. Barnes 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB

On a Closure Concept in Claw-Free Graphs

✍ Zdeněk Ryjáček 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 269 KB

If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in G and in cl(G) is the same. A sufficient condition for hamiltonicity in claw-free graphs, the equiv

On the hamiltonian path graph of a graph

✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

On the eulericity of a graph

✍ K. R. Matthews 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract The eulericity ϵ(__G__) of a bridgeless graph __G__ is defined as the least number of eulerian subgraphs of __G__ which together cover the lines of __G__. A 1–1 correspondence is shown to exist between the __k__‐tuples of eulerian subgraphs of __G__ and the proper flows (mod2^__k__^) on

On cycle bases of a graph

✍ M. M. Sysło 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB