scientific article; zbMATH DE number 1433954

zbMATH Open0941.05503MaRDI QIDQ4947488FDOQ4947488

Authors: Guanzhang Hu 

Publication date: 24 April 2000

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

Recommendations

• scientific article; zbMATH DE number 2094703
• scientific article; zbMATH DE number 1500531
• The \(a\)-graph coloring problem
• Approximations for  -Colorings of Graphs
• \((p,k)\)-coloring problems in line graphs
• The χt-coloring problem
• The complexity of some graph colouring problems
• scientific article; zbMATH DE number 25263
• The Maximum k-Colorable Subgraph Problem and Related Problems
• scientific article; zbMATH DE number 4070935

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem
• Properties of coloring the annular region
• On the tractability of \(( k , i )\)-coloring
• Coloring \(k\)-colorable graphs using smaller palettes
• \(k\)-colouring when \(k\) is close to \(\Delta\)
• The χt-coloring problem
• Title not available (Why is that?)
• Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable 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 Q4947488)