scientific article

zbMath0438.05029MaRDI QIDQ3879256

Ján Plesník

Publication date: 1980

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph partitioningcoloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some inequalities on the chromatic number of a graph
• A note on the complexity of the chromatic number problem
• Inequalities for the chromatic numbers of graphs
• Ramsey theory and chromatic numbers
• The Complexity of Near-Optimal Graph Coloring
• Every planar map is four colorable
• On Various Algorithms for Estimating the Chromatic Number of a Graph
• The biparticity of a graph
• Bounds on chromatic numbers of multiple factors of a complete graph
• The Eigenvalues of a Graph and Its Chromatic Number
• Bounds for the chromatic number of a graph
• A lower bound on the chromatic number of a graph
• k-Components, Clusters and Slicings in Graphs