Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.05331MaRDI QIDQ5897570FDOQ5897570

Authors:

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4087683
• The computation of chromatic polynomials
• Recursive formula for calculating the chromatic polynomial of a graph by vertex deletion
• scientific article; zbMATH DE number 4181365
• Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width

zbMATH Keywords

chordal graphsclique treeminimal triangulationChromatic polynomial

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• Title not available (Why is that?)
• Approximating the chromatic polynomial of a graph
• Efficient computation of the modular chromatic numbers of trees

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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