Clique algorithms for classifying substructures in generalized quadrangles

DOI10.1016/j.endm.2004.03.020zbMath1152.51301OpenAlexW2093378113MaRDI QIDQ3439132

Miroslava Cajkova, Veerle Fack

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.020

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized quadrangles and generalized polygons in finite geometry (51E12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• An exact algorithm for the maximum clique problem
• A fast algorithm for the maximum clique problem
• Unnamed Item
• Unnamed Item
• Unnamed Item