Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Greedy maximum-clique decompositions

From MaRDI portal
Publication:1340141
Jump to:navigation, search

DOI10.1007/BF01212981zbMath0813.05037OpenAlexW2047022952MaRDI QIDQ1340141

Sean McGuinness

Publication date: 18 May 1995

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01212981


zbMATH Keywords

maximum cliquesclique decomposition


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (2)

Greedy clique decompositions and the Turán numbers ⋮ Decomposing Graphs into Edges and Triangles




Cites Work

  • Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs
  • On a problem of G. O. H. Katona and T. Tarján
  • On the Decomposition of Graphs
  • The greedy clique decomposition of a graph
  • The Representation of a Graph by Set Intersections
  • Unnamed Item




This page was built for publication: Greedy maximum-clique decompositions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1340141&oldid=13471453"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki