Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Contentment in graph theory: Covering graphs with cliques
HTML
PDF
Details
Locations
Year:
1977
Type:
article
Source:
Indagationes Mathematicae (Proceedings)
DOI:
10.1016/1385-7258(77)90055-5
Author:
James Orlin
Institution:
Stanford University
Language:
English
Topic:
Advanced Graph Theory Research
Subfield:
Computational Theory and Mathematics
Field:
Computer Science
Domain:
Physical Sciences
Keywords:
clique cover,
cliques,
complete bipartite subgraphs,
projective plane,
NP-completeness,
matrix theory,
set theory,
graph theory,
NP-hardness
show all 9
Open Access status:
bronze
OpenAlex ID:
W2116453796
FWCI:
Cites:
13
Cited by:
364
Related to:
10