Representations of graphs modulo n
From MaRDI portal
Publication:1587599
DOI10.1016/S0012-365X(00)00062-5zbMATH Open0969.05046MaRDI QIDQ1587599FDOQ1587599
Authors: Anthony B. Evans, Garth Isaak, Darren Narayan 
Publication date: 3 December 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Orthogonal arrays, Latin squares, Room squares (05B15) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (21)
- Product dimension of forests and bounded treewidth graphs
- Dimension of a lobster
- Representation numbers of complete multipartite graphs
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
- Title not available (Why is that?)
- Representations of disjoint unions of complete graphs
- The representation number of some sparse graphs
- Title not available (Why is that?)
- Induced Embeddings into Hamming Graphs.
- Representations for complete graphs minus a disjoint union of paths
- Representations of split graphs, their complements, stars, and hypercubes
- Proving relations between modular graph functions
- Isoperimetry, stability, and irredundance in direct products
- Reduction graph and its application on algebraic graphs
- Representations of graphs and orthogonal latin square graphs
- Comparison of graphs associated to a commutative Artinian ring
- Congruences and subdirect representations of graphs
- Title not available (Why is that?)
- Representation numbers and Prague dimensions for complete graphs minus a disjoint union of paths
- Representations of signed graphs
- Algorithmic complexity of weakly semiregular partitioning and the representation number
This page was built for publication: Representations of graphs modulo \(n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587599)
