Lexicographic products with high reconstruction numbers
From MaRDI portal
Publication:418863
DOI10.1016/J.DISC.2012.02.004zbMATH Open1242.05182OpenAlexW2019579600MaRDI QIDQ418863FDOQ418863
Authors: Richard C. Brewster, Geňa Hahn, Stacey Wynn Lamont, Chester Lipka 
Publication date: 30 May 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.02.004
Recommendations
- Lexicographic products and a conjecture of Hahn and Jackson
- scientific article; zbMATH DE number 1145715
- On the pancyclicity of lexicographic products
- Representable lexicographic products
- Characterization of the hyperbolicity in the lexicographic product
- Lexicographic product and isoperimetric number
- Rees products and lexicographic shellability
- Infinite lexicographic products
- Sequential properties of lexicographic products
- Lexicographic product of digraphs and related boundary-type sets
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A congruence theorem for trees
- The composition of graphs
- Almost every graph has reconstruction number three
- The graph reconstruction number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The lexicographic product of graphs
- Families of pairs of graphs with a large number of common cards
- Graph reconstruction numbers
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Lexicographic products with high reconstruction numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418863)
