scientific article; zbMATH DE number 889953

zbMATH Open0855.05065MaRDI QIDQ4882469FDOQ4882469

Ingo Schiermeyer

Publication date: 26 January 1997

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

Recommendations

• scientific article; zbMATH DE number 4006291
• scientific article; zbMATH DE number 1830756
• Small Maximal Independent Sets and Faster Exact Graph Coloring

zbMATH Keywords

algorithmschromatic numbermaximal independent setmaximum degreeasymptotic complexity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• Title not available (Why is that?)
• Efficiency in exponential time for domination-type problems
• Enumerating maximal independent sets with applications to graph colouring.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Small Maximal Independent Sets and Faster Exact Graph Coloring
• Coloring fast without learning your neighbors' colors
• Faster graph coloring in polynomial space
• Three colorability characterized by shrinking of locally connected subgraphs into triangles

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