Dimension 4 and dimension 5 graphs with minimum edge set

MaRDI QIDQ2800781zbMATH OpenFDO

Authors Matt Noble, Joe Chaffee

Publication date 18 April 2016

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://ajc.maths.uq.edu.au//pdf/64/ajc_v64_p327.pdf

zbMATH Keywords

unit-distance graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• A dimension 6 graph with minimum edge-set
• A 4-dimensional graph has at least 9 edges
• Embedding graphs in Euclidean space
• On the dimension of a graph
• The dimension of a graph

Cited in

(7)

• A dimension 6 graph with minimum edge-set
• A 4-dimensional graph has at least 9 edges
• On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five
• Graphs of degree 4 are 5-edge-choosable
• On the dimension of a graph
• Embedding graphs in Euclidean space
• Embedding graphs in Euclidean space

This page was built for publication: Dimension 4 and dimension 5 graphs with minimum edge set

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