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

DOI10.1017/S0004972700026526zbMath0611.05052OpenAlexW1965488582MaRDI QIDQ3751619

Klaus Kriegel, Walter Wessel, Reinhard Pöschel

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

zbMATH Keywords

upper boundsdimensionlower boundsdomination numberclique covering number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Productive classes and subdirect irreducibility, in particular for graphs
• A Fast Algorithm for the Decomposition of Graphs and Posets

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