A Theorem on n-Coloring the Points of a Linear Graph
From MaRDI portal
Publication:3844889
DOI10.2307/2310826zbMath0108.36601MaRDI 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
Coloring-flow duality of embedded graphs, Interleaved adjoints of directed graphs, Diagrams, orientations, and varieties, A connection between circular colorings and periodic schedules, The circular chromatic number of hypergraphs, On reorienting graphs by pushing down maximal vertices, Flows and generalized coloring theorems in graphs, Gallai's problem on Dirac's construction, Acyclic orientations of a graph and the chromatic and independence numbers, Coloring graphs with no \(\text{odd-}K_4\), Circular colouring and orientation of graphs, Density via duality., A dualistic approach to bounding the chromatic number of a graph, Tension polynomials of graphs, Balanced Valuations and Flows in Multigraphs