scientific article

zbMATH Open0698.05034MaRDI QIDQ3475287

V. F. Gor'Kovoj

Publication date: 1989

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

zbMATH Keywords

graph homomorphismcontractible graphchromatic vertex-critical graph

Mathematics Subject Classification ID

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

Related Items (1)

The total coloring of \(K_5\)-minor-free graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Coloring algorithms for \(K_ 5\)-minor free graphs 👍 👎
• On the minimal number of edges in color-critical graphs 👍 👎
• The total coloring of \(K_5\)-minor-free graphs 👍 👎
• On the minimum number of edges in triangle-free 5-critical graphs 👍 👎
• On the size of edge chromatic 5-critical graphs 👍 👎
• Minimum C₅‐saturated graphs 👍 👎
• 5-coloring K_3,k-minor-free 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 Q3475287)