The dimension of graphs with respect to the direct powers of a two-element graph

DOI10.1017/S0004972700026526zbMATH Open0611.05052OpenAlexW1965488582MaRDI QIDQ3751619FDOQ3751619

Authors: Klaus Kriegel, Reinhard Pöschel, Walter Wessel 

Publication date: 1987

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700026526

Recommendations

• scientific article; zbMATH DE number 3970801
• The dimension of sums of graphs
• Graphs of small dimensions
• On a product dimension of bipartite graphs
• scientific article; zbMATH DE number 992948

zbMATH Keywords

domination numberlower boundsdimensionupper boundsclique covering number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fast Algorithm for the Decomposition of Graphs and Posets
• Productive classes and subdirect irreducibility, in particular for graphs

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Dimension of the sum of several copies of a graph

This page was built for publication: The dimension of graphs with respect to the direct powers of a two-element graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751619)