Lattices, whose incomparability graphs have horns
From MaRDI portal
Publication:396689
DOI10.1016/J.JDA.2013.07.001zbMATH Open1334.05173OpenAlexW1978484259MaRDI QIDQ396689FDOQ396689
Authors: Pradnya Survase, Meenakshi Wasadikar
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.07.001
Recommendations
bipartite graphzero-divisor graphincomparability graphscozero-divisor graphdouble star graphharnwidth of a lattice
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Path length in the covering graph of a lattice
- The cozero-divisor graph of a commutative ring
- Cover-incomparability graphs of posets
- The maximal size of the covering graph of a lattice
- The zero-divisor graph of a meet-semilattice
- Incomparability graphs of lattices. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coloring of lattices
- Some properties of graphs derived from lattices
Cited In (5)
This page was built for publication: Lattices, whose incomparability graphs have horns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396689)