Graphical partially ordered sets
From MaRDI portal
Publication:1104937
DOI10.1016/S0166-218X(87)80001-XzbMath0648.05040MaRDI QIDQ1104937
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Partial orders, general (06A06) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture, The \(k\)-orbit reconstruction and the orbit algebra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results on conversion matrices
- Lattice constants matricial equations for conversion matrices
- Parallel concepts in graph theory
- A note on the line reconstruction problem
- Lattice Constant Systems and Graph Theory
- Reconstructing Graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]