Chromatic number and skewness

DOI10.1016/0095-8956(75)90059-3zbMath0298.05116OpenAlexW2021336793MaRDI QIDQ1214432

Paul C. Kainen

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(75)90059-3

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Triangulability of convex graphs and convex skewness ⋮ On the skewness of products of graphs ⋮ Research problems ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Some results in topological graph theory ⋮ On the chromatic number of skew graphs

Cites Work

• Unnamed Item
• A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
• A Generalization of the 5-Color Theorem
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• An inequality for the chromatic number of a graph

This page was built for publication: Chromatic number and skewness