Minimal graphs that fold onto K_ n

DOI10.1016/0012-365X(93)E0227-UMaRDI QIDQ1896362zbMATH OpenOpenAlexFDO

Authors Guo-Gang Gao, Geňa Hahn

Publication date 8 February 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)e0227-u

zbMATH Keywords

Cook and Evans conjectureminimal graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Graph theory (05C99)

Review text

The authors disprove the Cook and Evans conjecture. Their method is somewhat simpler and different than in [\textit{F. Buckley} and \textit{L. Superville}, The theory and applications of graphs, 4th int. Conf., Kalamazoo/Mich. 1980, 149-158 (1981; Zbl 0482.05036)].

Recommendations

• scientific article; zbMATH DE number 5211465
• scientific article; zbMATH DE number 1146230
• On the folding of graphs-theory and application
• scientific article; zbMATH DE number 4006304
• Folding list of graphs obtained from a given graph

Cites work

• Concerning the achromatic number of graphs
• Graph theory
• scientific article; zbMATH DE number 3666852 (Why is no real title available?)
• scientific article; zbMATH DE number 3756510 (Why is no real title available?)

Cited in

(1)

• Proximity drawings of high-degree trees

This page was built for publication: Minimal graphs that fold onto \(K_ n\)

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