𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximal cliques in -free graphs

✍ Scribed by S.A. Choudum; T. Karthick

Book ID
108114260
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
342 KB
Volume
310
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Coloring the Maximal Cliques of Graphs
Coloring the Maximal Cliques of Graphs
✍ BacsΓ³, GΓ‘bor; Gravier, Sylvain; GyΓ‘rfΓ‘s, AndrΓ‘s; Preissmann, Myriam; Sebo, AndrΓ‘ πŸ“‚ Article πŸ“… 2004 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 195 KB
Large Cliques in-Free Graphs
Large Cliques in-Free Graphs
✍ AndrΓ‘s GyΓ‘rfΓ‘s; Alice Hubenko; JΓ³zsef Solymosi πŸ“‚ Article πŸ“… 2002 πŸ› Springer-Verlag 🌐 English βš– 130 KB
Dominating cliques in P5-free graphs
Dominating cliques in P5-free graphs
✍ G. BacsΓ³; Zs. Tuza πŸ“‚ Article πŸ“… 1990 πŸ› Springer Netherlands 🌐 English βš– 372 KB
Square Hamiltonian cycles in graphs with
Square Hamiltonian cycles in graphs with maximal 4-cliques
✍ H.A. Kierstead; Juan Quintana πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 615 KB

The square of a graph is obtained by adding additional edges joining all pairs of vertices with distance two in the original graph. P6sa conjectured that if G is a simple graph on n vertices with minimum degree 2n/3, then G contains the square of a hamiltonian cycle. We show that P6sa's conjecture h