scientific article; zbMATH DE number 4047752

MaRDI QIDQ3784094zbMATH OpenFDO

Authors Mieczysław Borowiecki

Publication date 1987

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Two conjectures on uniquely totally colorable graphs
• Extremal graphs in some coloring problems
• Extremal problems for colourings of uniform hypergraphs
• scientific article; zbMATH DE number 3924805
• scientific article; zbMATH DE number 568840
• Two extremal problems in graph theory
• Extremal Graph Problems for Graphs with a Color-Critical Vertex
• scientific article; zbMATH DE number 1047736
• An extremal problem on non-full colorable graphs
• scientific article; zbMATH DE number 3924817

Cited in

(7)

• A bibliography on chromatic polynomials
• On small uniquely vertex-colourable graphs and Xu's conjecture
• On 1-uniqueness and dense critical graphs for tree-depth
• The size of uniquely colorable graphs
• scientific article; zbMATH DE number 1094148 (Why is no real title available?)
• Colourings of (k-r,k)-trees
• scientific article; zbMATH DE number 4183438 (Why is no real title available?)

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