scientific article; zbMATH DE number 4114659

MaRDI QIDQ4729807zbMATH OpenFDO

Authors Felix Lazebnik

Publication date 1988

zbMATH Keywords

chromatic polynomialproper vertex colouring

Mathematics Subject Classification ID

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

Recommendations

• New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
• scientific article; zbMATH DE number 1262192
• Some corollaries of a theorem of Whitney on the chromatic polynomial
• On the greatest number of 2 and 3 colorings of a (v, e)-graph
• Maximum number of colorings of (2k, k²)‐graphs

Cited in

(11)

• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs
• The maximum number of colorings of graphs of given order and size: a survey
• Counting the number of non-equivalent vertex colorings of a graph
• scientific article; zbMATH DE number 3941566 (Why is no real title available?)
• New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
• scientific article; zbMATH DE number 1262192 (Why is no real title available?)
• A note on graph colouring
• Maximizing proper colorings on graphs
• Maximum number of colorings of (2k, k²)‐graphs
• Maximal colourings for 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 Q4729807)