Minimum graphs with complete k-closure

DOI10.1016/0012-365X(80)90110-7zbMath0448.05039OpenAlexW1978165383MaRDI QIDQ1146691

D. E. Jackson, Roger Entringer, Lane H. Clark

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)

Related Items

Stable properties of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A method in graph theory
• On Hamilton's ideals
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs