scientific article; zbMATH DE number 790416

MaRDI QIDQ4846497zbMATH OpenFDO

Authors Heiko Harborth, Hauke Nienborg

Publication date 20 February 1996

zbMATH Keywords

four-cyclecube graphErdös problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Maximum number of edges joining vertices on a cube
• Publication:4867547
• scientific article; zbMATH DE number 2094523
• scientific article; zbMATH DE number 140095
• Discrete and Computational Geometry
• scientific article; zbMATH DE number 4029610
• The maximum number of cycles in a graph with fixed number of edges
• Extremal numbers for cycles in a hypercube
• On the maximal number of edges of many faces in an arrangement
• Total coloring of plane graphs with maximum degree six and without intersecting triangles and 4-cycles

Cited in

(9)

• scientific article; zbMATH DE number 4029610 (Why is no real title available?)
• Hypercube subgraphs with local detours
• Maximum number of edges joining vertices on a cube
• An effective and simple heuristic for the set covering problem
• An efficient local search heuristic with row weighting for the unicost set covering problem
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Some Turán type results on the hypercube
• Bounding the size of square-free subgraphs of the hypercube
• A 4-dimensional graph has at least 9 edges

This page was built for publication:

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