On (1, 2)-realizable graphs

DOI10.1016/0012-365X(95)00069-9zbMath0876.05073OpenAlexW2075275840MaRDI QIDQ1815308

Yanyan Li

Publication date: 10 December 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00069-9

zbMATH Keywords

neighbourhood\((1,2)\)-realizable graph

Mathematics Subject Classification ID

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

Cites Work

• Which trees are link graphs?
• On graphs with a constant link. II
• Strongly regular graphs
• On graphs with given environments of vertices
• Parallel concepts in graph theory
• Graphs with constant link and small degree or order
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On (1, 2)-realizable graphs