Infinite \(\Phi\)-periodic graphs

DOI10.1007/BF03322213zbMath0858.05080OpenAlexW2092411408MaRDI QIDQ1911989

Erich Prisner

Publication date: 23 March 1997

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03322213

zbMATH Keywords

line graphinfinite graphcliquegraph operatorgraph-valued function

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality and perfection for edges in cliques
• An algorithm to recognize a middle graph
• Clique graphs and Helly graphs
• \(K_ i\)-covers. I: Complexity and polytopes
• Two classes of perfect graphs
• Graphs isomorphic to subgraphs of their line-graphs
• Edge-clique graphs
• Traversability and connectivity of the middle graph of a graph
• The super line graph \({\mathfrak L}_2\)
• The dynamics of the line and path graph operators
• Iterated \(k\)-line graphs
• Existence and structure of self-adjoint graphs
• Path graphs
• A bibliography of graph equations
• A common generalization of line graphs and clique graphs
• On the two‐edge‐colorings of perfect graphs
• The Isomorphism between Graphs and their Adjoint Graphs
• The interchange graph of a finite graph

This page was built for publication: Infinite \(\Phi\)-periodic graphs