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

scientific article; zbMATH DE number 867639

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

zbMATH Open0840.05044MaRDI QIDQ4873751FDOQ4873751

Felix Lazebnik

Publication date: 22 April 1996



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


zbMATH Keywords

algorithmchromatic numberextremal graphsindependent setnumber of maximal independent sets


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)



Cited In (4)

  • Enumerating maximal independent sets with applications to graph colouring.
  • Constraints on the number of maximal independent sets in graphs
  • Title not available (Why is that?)
  • Small Maximal Independent Sets and Faster Exact Graph Coloring


   Recommendations
  • On the number of maximal independent sets in a graph ๐Ÿ‘ ๐Ÿ‘Ž
  • Enumerating maximal independent sets with applications to graph colouring. ๐Ÿ‘ ๐Ÿ‘Ž
  • Small Maximal Independent Sets and Faster Exact Graph Coloring ๐Ÿ‘ ๐Ÿ‘Ž
  • Integers for the number of maximal independent sets in graphs ๐Ÿ‘ ๐Ÿ‘Ž





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 Q4873751)

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