Decomposition tree of a lexicographic product of binary structures
DOI10.1016/J.DISC.2011.05.037zbMATH Open1244.05059OpenAlexW1996888602MaRDI QIDQ409340FDOQ409340
Authors: P. Ille, R. E. Woodrow
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.037
Recommendations
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76) Graph theory (05C99) Other classical set theory (including functions, relations, and set algebra) (03E20)
Cites Work
- Weakly partitive families on infinite sets
- Transitiv orientierbare Graphen
- \(P_ 4\)-trees and substitution decomposition
- Title not available (Why is that?)
- Intervals of Sabidussi graphs
- Linear-time modular decomposition of directed graphs
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The lexicographic product of graphs
Cited In (4)
This page was built for publication: Decomposition tree of a lexicographic product of binary structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409340)