Some observations on the determination of an upper bound for the clique number of a graph

DOI10.1016/0020-0190(75)90054-XMaRDI QIDQ1220089zbMATH OpenFDO

Authors J. Nieminen

Publication date 1975

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(75)90054-X

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99)

Cites work

• An upper bound for the chromatic number of a graph and its application to timetabling problems
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Parallel concepts in graph theory
• The Enumeration of Maximal Cliques of Large Graphs
• Upper Bounds on the Order of a Clique of a Graph

Cited in

(1)

• New bounds for the clique number of a graph

This page was built for publication: Some observations on the determination of an upper bound for the clique number of a graph

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