Quadrilateral line graphs

MaRDI QIDQ2785710zbMATH OpenFDO

Authors Gary Chartrand, Michael A. Henning, Elzbieta B. Jarrett, Curtiss E. Wall

Publication date 25 February 1997

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

eulerianhamiltonianquadrilateral line graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Review text

The quadrilateral line graph \(Q(G)\) of a graph \(G\) has the edges of \(G\) as its vertices and two vertices of \(Q(G)\) are adjacent if the corresponding edges in \(G\) are adjacent and lie in a common 4-cycle. The authors provide sufficient conditions for such graphs to be eulerian and hamiltonian. Examining iterations of \(Q(G)\) next, they explain the difficulty of characterizing convergence in terms of forbidden subgraphs by citing a peculiar property of \(Q(K_{3,3})\).

Recommendations

• Lines with quadrangle section
• On quadrilaterals in a graph
• Straight-Line Drawing of Quadrangulations
• Quadrance graphs
• Quadrilaterals and pentagons in arrangements of lines
• Quadrilaterals and tetrahedra
• scientific article; zbMATH DE number 3191377

Cited in

(7)

• Über ebene Vierecksgraphen. (On plane quadrangular graphs)
• Limits of iterated \(H\)-line graphs
• On quadrilaterals in a graph
• Convergence of sequences of iterated triangular line graphs
• Convergent sequences of iterated \(H\)-line graphs
• Quartic graphs with every edge in a triangle
• On sequences of P_n-line graphs

This page was built for publication: Quadrilateral line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2785710)