Premium
The greedy clique decomposition of a graph
Author(s) -
McGuinness Sean
Publication year - 1994
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190180412
Subject(s) - combinatorics , mathematics , clique graph , conjecture , graph , simplex graph , clique , clique number , perfect graph , discrete mathematics , split graph , line graph , graph power , pathwidth
We prove that if maximal cliques are removed one by one from any graph with n vertices, then the graph will be empty after at most n 2 /4 steps. This proves a conjecture of Winkler.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom