Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 4039954

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

zbMATH Open0638.05043MaRDI QIDQ3778792FDOQ3778792


Authors: Hansjoachim Walther Edit this on Wikidata


Publication date: 1987



Title of this publication is not available (Why is that?)



Recommendations

  • Clique covering of graphs
  • scientific article; zbMATH DE number 3762108
  • A simple lower bound on edge coverings by cliques
  • scientific article; zbMATH DE number 426342
  • Covering all cliques of a graph


zbMATH Keywords

maximum cliqueedge-coveringedge-disjoint cliques


Mathematics Subject Classification ID

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



Cited In (4)

  • On clique convergent graphs
  • Clique parts independent of remainders
  • Title not available (Why is that?)
  • Dyck's map \(\{3,7\}_ 8\) is a counterexample to a clique covering conjecture





This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3778792&oldid=17328052"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 12:53. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki