scientific article; zbMATH DE number 861311
From MaRDI portal
Publication:4871035
zbMATH Open0843.05057MaRDI QIDQ4871035FDOQ4871035
Authors: David K. Garnick, Y. H. Harris Kwong, Felix Lazebnik 
Publication date: 21 May 1996
Title of this publication is not available (Why is that?)
Recommendations
- Graph extremities defined by search algorithms
- Algorithms and complexity results for finding graphs with extremal Randić index
- scientific article
- The Alcuin number of graphs with maximum degree five
- On extremal graphs with bounded girth
- scientific article
- 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_5\), gem)-free graphs
- A randomized algorithm for determining dominating sets in graphs of maximum degree five
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)
Cited In (10)
- Calculating the extremal number
- Graphs with maximum size and lower bounded girth
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
- Using simulated annealing to construct extremal graphs
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Graph extremities defined by search algorithms
- Title not available (Why is that?)
- A randomized algorithm for determining dominating sets in graphs of maximum degree five
- Simulated annealing: Practice versus theory
- Extremal graphs without three‐cycles or four‐cycles
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)
