scientific article; zbMATH DE number 2230224

zbMath1075.05547MaRDI QIDQ5708515

Carmen Ortiz Z., Mónica Villanueva-Ilufi

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Counting and enumerating independent sets with applications to combinatorial optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Critical star multigraphs
• The number of maximal independent sets in a connected graph
• Two conjectures on edge-colouring
• NP-completeness of edge-colouring some restricted graphs
• Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
• Threshold graphs and related topics
• Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
• The number of maximal independent sets in connected graphs
• The Complexity of Enumeration and Reliability Problems
• The chromatic index of graphs with a spanning star
• The NP-Completeness of Edge-Coloring
• Efficient algorithms for interval graphs and circular-arc graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: