Note on strong product graph dimension
From MaRDI portal
Publication:5888906
Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Algebraic combinatorics (05E99) Combinatorics of partially ordered sets (06A07) Special categories (18B99) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)
Recommendations
Cites work
- scientific article; zbMATH DE number 3970801 (Why is no real title available?)
- scientific article; zbMATH DE number 4012654 (Why is no real title available?)
- scientific article; zbMATH DE number 4059462 (Why is no real title available?)
- scientific article; zbMATH DE number 3747193 (Why is no real title available?)
- scientific article; zbMATH DE number 3747196 (Why is no real title available?)
- scientific article; zbMATH DE number 3752870 (Why is no real title available?)
- scientific article; zbMATH DE number 3785134 (Why is no real title available?)
- scientific article; zbMATH DE number 37880 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 3563183 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1420986 (Why is no real title available?)
- A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
- Complexity of dimension three and some related edge-covering characteristics of graphs
- Graph fractal dimension and the structure of fractal networks
- Kneser ranks of random graphs and minimum difference representations
- Notes on graph product structure theory
- On a product dimension of bipartite graphs
- On a product dimension of graphs
- On classes of relations and graphs determined by subobjects and factorobjects
- On qualitatively independent partitions and related problems
- On the dimension of trees
- On the product dimension of clique factors
- Partitions of graphs into cographs
- Planar graphs have bounded queue-number
- Productive classes and subdirect irreducibility, in particular for graphs
This page was built for publication: Note on strong product graph dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5888906)