A Theorem on Coloring the Lines of a Network
From MaRDI portal
Publication:5790769
DOI10.1002/sapm1949281148zbMath0032.43203OpenAlexW2330003519MaRDI 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 (98)
The chromatic index of nearly bipartite multigraphs ⋮ Small embeddings for partial 5-cycle systems ⋮ Facial packing edge-coloring of plane graphs ⋮ Algorithms for data migration ⋮ Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI ⋮ Unnamed Item ⋮ A generalization of edge-coloring in graphs ⋮ Unnamed Item ⋮ List edge and list total colourings of multigraphs ⋮ Extension from precoloured sets of edges ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ A Combined Logarithmic Bound on the Chromatic Index of Multigraphs ⋮ Applications of edge coloring of multigraphs to vertex coloring of graphs ⋮ An application of matching theory of edge-colourings ⋮ Edge-coloring of multigraphs: Recoloring technique ⋮ Some upper bounds on the total and list chromatic numbers of multigraphs ⋮ The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) ⋮ Networks communicating for each pairing of terminals ⋮ Facial rainbow edge-coloring of plane graphs ⋮ Edge-coloring of plane multigraphs with many colors on facial cycles ⋮ Using the minimum maximum flow degree to approximate the flow coloring problem ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ On the inclusion chromatic index of a graph ⋮ Decomposition of class II graphs into two class I graphs ⋮ Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ An alternating direction method of multipliers for solving user equilibrium problem ⋮ Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model ⋮ Independence in 5-uniform hypergraphs ⋮ Short Fans and the 5/6 Bound for Line Graphs ⋮ Bounds for the chromatic index of signed multigraphs ⋮ Approximating the chromatic index of multigraphs ⋮ Improved approximation algorithms for data migration ⋮ A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Hadwiger's Conjecture for ℓ‐Link Graphs ⋮ On the cyclic coloring conjecture ⋮ A survey on the cyclic coloring and its relaxations ⋮ Improved bounds for the chromatic index of graphs and multigraphs ⋮ The maximum edge-disjoint paths problem in complete graphs ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Graph edge coloring: a survey ⋮ Unnamed Item ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ Facial edge ranking of plane graphs ⋮ Small transversals in hypergraphs ⋮ Chromatic index determined by fractional chromatic index ⋮ Obituary: Claude Elwood Shannon 1916-2001 ⋮ On the fractional matching polytope of a hypergraph ⋮ Chromatic index of simple hypergraphs ⋮ Measurable versions of Vizing's theorem ⋮ On disjoint matchings in cubic graphs ⋮ Graph edge colouring: Tashkinov trees and Goldberg's conjecture ⋮ Path problems in generalized stars, complete graphs, and brick wall graphs ⋮ Unnamed Item ⋮ Vizing's coloring algorithm and the fan number ⋮ On the fg-coloring of graphs ⋮ Bounding χ in terms of ω and Δ for quasi-line graphs ⋮ Generalized edge-colorings of weighted graphs ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ Facial non-repetitive edge-coloring of plane graphs ⋮ The edge chromatic number of a directed/mixed multigraph ⋮ Unnamed Item ⋮ Edge coloring multigraphs without small dense subsets ⋮ Lower bounds on the cover-index of a graph ⋮ On fans in multigraphs ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ A bibliographic survey of edge‐colorings ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 ⋮ Colouring the edges of a multigraph ⋮ Achieving maximum chromatic index in multigraphs ⋮ Facial visibility in edge colored plane graphs ⋮ Goldberg's conjecture is true for random multigraphs ⋮ Efficient algorithms for wavelength assignment on trees of rings ⋮ Short solution of Kotzig's problem for bipartite graphs ⋮ Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs ⋮ On characterizing Vizing's edge colouring bound ⋮ On Vizing's bound for the chromatic index of a multigraph ⋮ Some applications of Vizing's theorem to vertex colorings of graphs ⋮ Chromatic index of hypergraphs and Shannon's theorem ⋮ Coloring quasi-line graphs ⋮ Edge-coloring of multigraphs ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ A sublinear bound on the chromatic index of multigraphs ⋮ The edge intersection graphs of paths in a tree ⋮ Vizing's and Shannon's theorems for defective edge colouring ⋮ Edge and vertex intersection of paths in a tree ⋮ On the coequal values of total chromatic number and chromatic index ⋮ A brief history of edge-colorings – with personal reminiscences ⋮ Decomposition by clique separators ⋮ A new method of proving theorems on chromatic index ⋮ On the edge multicoloring of unicyclic graphs ⋮ An efficient parallel algorithm for computing a large independent set in a planar graph ⋮ Bounds for the rainbow disconnection numbers of graphs ⋮ Intersecting designs from linear programming and graphs of diameter two ⋮ Mono-multi bipartite Ramsey numbers, designs, and matrices
This page was built for publication: A Theorem on Coloring the Lines of a Network
