A Theorem on Coloring the Lines of a Network
From MaRDI portal
Publication:5790769
DOI10.1002/sapm1949281148zbMath0032.43203MaRDI QIDQ5790769
Publication date: 1949
Published in: Journal of Mathematics and Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/sapm1949281148
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On the fractional matching polytope of a hypergraph, Small transversals in hypergraphs, Lower bounds on the cover-index of a graph, A sublinear bound on the chromatic index of multigraphs, Intersecting designs from linear programming and graphs of diameter two, List edge and list total colourings of multigraphs, Short solution of Kotzig's problem for bipartite graphs, Chromatic index of hypergraphs and Shannon's theorem, An application of matching theory of edge-colourings, Colouring the edges of a multigraph, Edge-coloring of multigraphs, Unnamed Item, Some upper bounds on the total and list chromatic numbers of multigraphs, Networks communicating for each pairing of terminals, Unnamed Item, A bibliographic survey of edge‐colorings