Chromatic number and skewness

DOI10.1016/0095-8956(75)90059-3zbMATH Open0298.05116OpenAlexW2021336793MaRDI QIDQ1214432FDOQ1214432

Authors: 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)

Cites Work

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

Cited In (6)

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

This page was built for publication: Chromatic number and skewness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1214432)