scientific article; zbMATH DE number 861311

MaRDI QIDQ4871035zbMATH OpenFDO

Authors David K. Garnick, Y. H. Harris Kwong, Felix Lazebnik

Publication date 21 May 1996

zbMATH Keywords

algorithmslower boundsextremal graphsgirth

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Recommendations

• Graph extremities defined by search algorithms
• Algorithms and complexity results for finding graphs with extremal Randić index
• scientific article; zbMATH DE number 4156240
• The Alcuin number of graphs with maximum degree five
• On extremal graphs with bounded girth
• scientific article; zbMATH DE number 4174651
• An exact algorithm for maximum independent set in degree-5 graphs
• An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
• On algorithms for (P₅, gem)-free graphs
• A randomized algorithm for determining dominating sets in graphs of maximum degree five

Cited in

(11)

• Graphs with maximum size and lower bounded girth
• scientific article; zbMATH DE number 810049 (Why is no real title available?)
• Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
• Extremal graphs without three‐cycles or four‐cycles
• Graph extremities defined by search algorithms
• Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
• A randomized algorithm for determining dominating sets in graphs of maximum degree five
• Simulated annealing: Practice versus theory
• Using simulated annealing to construct extremal graphs
• Calculating the extremal number
• Radius \(r\) extremal graphs of girth 5

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 Q4871035)