Clique algorithms for classifying substructures in generalized quadrangles

DOI10.1016/J.ENDM.2004.03.020MaRDI QIDQ3439132zbMATH OpenOpenAlexFDO

Authors Miroslava Cajkova, V. 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Generalized quadrangles and generalized polygons in finite geometry (51E12)

Cites work

• A fast algorithm for the maximum clique problem
• An exact algorithm for the maximum clique problem
• scientific article; zbMATH DE number 3877205 (Why is no real title available?)
• scientific article; zbMATH DE number 4030354 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

This page was built for publication: Clique algorithms for classifying substructures in generalized quadrangles

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