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

On the number of distinct minimal clique partitions and clique covers of a line graph

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

DOI10.1016/0012-365X(90)90220-CzbMath0739.05049MaRDI QIDQ1813995

Sean McGuinness, R. S. Rees

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)



Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)


Related Items (2)

Clique coverings and partitions of line graphs ⋮ Eigenvalues and clique partitions of graphs




Cites Work

  • Clique partitions of the cocktail party graph
  • Unnamed Item




This page was built for publication: On the number of distinct minimal clique partitions and clique covers of a line graph

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