Minimum graphs with complete k-closure

DOI10.1016/0012-365X(80)90110-7MaRDI QIDQ1146691zbMATH OpenOpenAlexFDO

Authors D. E. Jackson, Lane Clark, R. C. Entringer

Publication date 1980

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(80)90110-7

zbMATH Keywords

minimum number of edgesk-closure of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• A method in graph theory
• Graph theory
• Note on Hamilton Circuits
• On Hamilton's ideals
• Some Theorems on Abstract Graphs

Cited in

(1)

• Stable properties of graphs

This page was built for publication: Minimum graphs with complete k-closure

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