Residually-Complete Graphs

DOI10.1016/S0167-5060(08)70698-8MaRDI QIDQ3897076zbMATH OpenOpenAlexWikidataFDO

Authors Frank Harary, Maria M. Klawe, P. Erdős

Publication date 1980

Published in Combinatorial Mathematics, Optimal Designs and Their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70698-8

zbMATH Keywords

complete graphsresidual graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• On connected 2-K_n-residual graphs
• On connected K_n-residual graphs
• Two improvements on the Erdős, Harary and Klawe conjecture
• A note on connected \(2\)-\({K_n}\)-residual graphs
• On connected m-K₂-residual graphs.

Cited in

(10)

• Triangulating remnants of complete graphs
• Two improvements on the Erdős, Harary and Klawe conjecture
• On connected m multiply 2 dimensions composite hyperplane complete graph's residual graphs
• On connected K_n-residual graphs
• On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs
• Residually complete graphs with odd order
• scientific article; zbMATH DE number 2188408 (Why is no real title available?)
• Distance-residual subgraphs
• On connected 2-K_n-residual graphs
• Multiply hyperplane complete residual graph

This page was built for publication: Residually-Complete Graphs

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