A characterization of lattice-ordered graphs

zbMATH Open1125.05068MaRDI QIDQ5754498FDOQ5754498

Authors: David Leach, Matt Walsh 

Publication date: 22 August 2007

Full work available at URL: http://www.integers-ejcnt.org/vol7-2.html

Recommendations

• scientific article; zbMATH DE number 3912404
• Simple congruence lattices of finite graphs
• The poset of unlabeled induced subgraphs of a finite graph
• scientific article; zbMATH DE number 2010173
• Incomparability graphs of lattices

zbMATH Keywords

induced subgraphsLattice

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)

Cited In (5)

• Applications of lattice theory to graph decomposition
• Finite Simple Graphs and Their Associated Graph Lattices
• The poset of unlabeled induced subgraphs of a finite graph
• The ordered set of connected parts of a polygonal graph
• The system of abstract connected subgraphs of a linear graph

This page was built for publication: A characterization of lattice-ordered graphs

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