On (1, 2)-realizable graphs
From MaRDI portal
Publication:1815308
DOI10.1016/0012-365X(95)00069-9zbMATH Open0876.05073OpenAlexW2075275840MaRDI QIDQ1815308FDOQ1815308
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
Recommendations
- Realizability of graphs
- scientific article; zbMATH DE number 426355
- scientific article
- Realizability and uniqueness in graphs
- Realizability of graphs and linkages
- On realizability of graphs as \({\Gamma_S} (L)\) for some lattice \(L\)
- On realization graphs of degree sequences
- Constructing uniquely realizable graphs
- Graphs with real algebraic co-rank at most two
- On the realizability of a graph as the Gruenberg-Kegel graph of a finite group
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (05C99)
Cites Work
- Graphs with constant link and small degree or order
- Parallel concepts in graph theory
- Strongly regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Which trees are link graphs?
- On graphs with a constant link. II
- On graphs with given environments of vertices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: On (1, 2)-realizable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815308)