A Theorem on n-Coloring the Points of a Linear Graph
From MaRDI portal
Publication:3844889
DOI10.2307/2310826zbMath0108.36601OpenAlexW4237970067MaRDI QIDQ3844889
Publication date: 1962
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2310826
Related Items (25)
Cycles in color-critical graphs ⋮ On reorienting graphs by pushing down maximal vertices ⋮ Problems on cycles and colorings ⋮ Flows and generalized coloring theorems in graphs ⋮ Odd Solutions to Systems of Inequalities Coming From Regular Chain Groups ⋮ Resource-sharing systems and hypergraph colorings ⋮ Congruence of cycle lengths and chromatic number ⋮ On graphs whose orientations are determined by their Hermitian spectra ⋮ Complexity results for weighted timed event graphs ⋮ Many Facets of Dualities ⋮ Diagrams, orientations, and varieties ⋮ Interleaved adjoints of directed graphs ⋮ A dualistic approach to bounding the chromatic number of a graph ⋮ Gallai's problem on Dirac's construction ⋮ Acyclic orientations of a graph and the chromatic and independence numbers ⋮ Coloring-flow duality of embedded graphs ⋮ A connection between circular colorings and periodic schedules ⋮ Chromatic number and orientations of graphs and signed graphs ⋮ Balanced Valuations and Flows in Multigraphs ⋮ The circular chromatic number of hypergraphs ⋮ Coloring graphs with no \(\text{odd-}K_4\) ⋮ Circular colouring and orientation of graphs ⋮ Density via duality. ⋮ Cycles and new bounds for the chromatic number ⋮ Tension polynomials of graphs
This page was built for publication: A Theorem on n-Coloring the Points of a Linear Graph
