The l₁-embeddability of trees, unicyclic graphs and their line graphs

MaRDI QIDQ4986004zbMATH OpenFDO

Authors Chenyang Li, Guangfu Wang

Publication date 26 April 2021

zbMATH Keywords

\({l_1}\)-graphline graphtreeunicyclic graph

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Clin d'oeil on L₁-embeddable planar graphs
• Publication:4888120
• A note on \(l_ 1\)-rigid planar graphs
• l₁-embeddability of hexagonal and quadrilateral Möbius graphs.
• \(l_1\)-embeddability under the edge-gluing operation on graphs

Cited in

(9)

• Polyhexes that are \(\ell _1\) graphs
• Graphs isomorphic to subgraphs of their iterated line graphs
• Complementary _1-graphs embeddable in the half-cube
• \(l_1\)-embeddability of generic quadrilateral Möbius maps
• Structural and complexity aspects of line systems of graphs
• \(l_1\)-embeddability under the edge-gluing operation on graphs
• l₁-embeddability of hexagonal and quadrilateral Möbius graphs.
• scientific article; zbMATH DE number 908803 (Why is no real title available?)
• Cuts, trees and \(\ell_1\)-embeddings of graphs

This page was built for publication: The \({l_1}\)-embeddability of trees, unicyclic graphs and their line graphs

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