scientific article; zbMATH DE number 3683613

MaRDI QIDQ3879256zbMATH OpenFDO

Authors Ján Plesník

Publication date 1980

Full work available at URL https://eudml.org/doc/34079

zbMATH Keywords

coloringgraph partitioning

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• k-Components, Clusters and Slicings in Graphs
• A lower bound on the chromatic number of a graph
• A note on the complexity of the chromatic number problem
• Bounds for the chromatic number of a graph
• Bounds on chromatic numbers of multiple factors of a complete graph
• Every planar map is four colorable
• scientific article; zbMATH DE number 3482375 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3312524 (Why is no real title available?)
• scientific article; zbMATH DE number 3404264 (Why is no real title available?)
• scientific article; zbMATH DE number 3184555 (Why is no real title available?)
• Inequalities for the chromatic numbers of graphs
• On Various Algorithms for Estimating the Chromatic Number of a Graph
• Ramsey theory and chromatic numbers
• Some inequalities on the chromatic number of a graph
• The biparticity of a graph
• The Complexity of Near-Optimal Graph Coloring
• The Eigenvalues of a Graph and Its Chromatic Number

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