A Theorem on Coloring the Lines of a Network

Cited in

(only showing first 100 items - show all)

The maximum edge-disjoint paths problem in complete graphs
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
A new method of proving theorems on chromatic index
Mono-multi bipartite Ramsey numbers, designs, and matrices
Algorithms for data migration
On characterizing Vizing's edge colouring bound
Facial edge ranking of plane graphs
On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
Approximating the chromatic index of multigraphs
Facial non-repetitive edge-coloring of plane graphs
Small transversals in hypergraphs
scientific article; zbMATH DE number 1523257 (Why is no real title available?)
Short fans and the 5/6 bound for line graphs
Intersecting designs from linear programming and graphs of diameter two
On Vizing's bound for the chromatic index of a multigraph
Chromatic index determined by fractional chromatic index
On the edge multicoloring of unicyclic graphs
A generalization of edge-coloring in graphs
Some upper bounds on the total and list chromatic numbers of multigraphs
Edge and vertex intersection of paths in a tree
On fans in multigraphs
Edge-coloring of multigraphs: Recoloring technique
A bibliographic survey of edge‐colorings
Edge-coloring of plane multigraphs with many colors on facial cycles
Graph edge coloring: a survey
Chromatic index of hypergraphs and Shannon's theorem
List edge and list total colourings of multigraphs
Decomposition by clique separators
Lower bounds on the cover-index of a graph
scientific article; zbMATH DE number 3580563 (Why is no real title available?)
Improved bounds for the chromatic index of graphs and multigraphs
Facially-constrained colorings of plane graphs: a survey
Some applications of Vizing's theorem to vertex colorings of graphs
Improved approximation algorithms for data migration
Bounding χ in terms of ω and Δ for quasi-line graphs
The chromatic index of nearly bipartite multigraphs
Coloring quasi-line graphs
On the fractional matching polytope of a hypergraph
Tree-like distance colouring for planar graphs of sufficient girth
The edge chromatic number of a directed/mixed multigraph
Applications of edge coloring of multigraphs to vertex coloring of graphs
Independence in 5-uniform hypergraphs
Short solution of Kotzig's problem for bipartite graphs
An efficient parallel algorithm for computing a large independent set in a planar graph
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
Edge coloring multigraphs without small dense subsets
Edge-coloring of multigraphs
A sublinear bound on the chromatic index of multigraphs
Hadwiger's conjecture for \(\ell\)-link graphs
Facial packing edge-coloring of plane graphs
Facial rainbow edge-coloring of plane graphs
On disjoint matchings in cubic graphs
Interval non-edge-colorable bipartite graphs and multigraphs
A combined logarithmic bound on the chromatic index of multigraphs
The edge intersection graphs of paths in a tree
An alternating direction method of multipliers for solving user equilibrium problem
Graph edge colouring: Tashkinov trees and Goldberg's conjecture
A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
scientific article; zbMATH DE number 3378939 (Why is no real title available?)
Goldberg's conjecture is true for random multigraphs
Path problems in generalized stars, complete graphs, and brick wall graphs
Extension from precoloured sets of edges
A unified approach to distance-two colouring of graphs on surfaces
Networks communicating for each pairing of terminals
Achieving maximum chromatic index in multigraphs
Chromatic index of simple hypergraphs
Bounds for the rainbow disconnection numbers of graphs
An application of matching theory of edge-colourings
Efficient algorithms for wavelength assignment on trees of rings
Obituary: Claude Elwood Shannon 1916-2001
Vizing's and Shannon's theorems for defective edge colouring
Bounds for the chromatic index of signed multigraphs
scientific article; zbMATH DE number 3405975 (Why is no real title available?)
The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)
Facial visibility in edge colored plane graphs
On the fg-coloring of graphs
Measurable versions of Vizing's theorem
Colouring the edges of a multigraph
On the complexity of the smallest grammar problem over fixed alphabets
Orientation‐based edge‐colorings and linear arboricity of multigraphs
On the inclusion chromatic index of a graph
On the cyclic coloring conjecture
Graphs, disjoint matchings and some inequalities
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
Two Chromatic Conjectures: One for Vertices and One for Edges
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
scientific article; zbMATH DE number 6965186 (Why is no real title available?)
Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
Graph and hypergraph colouring via nibble methods: a survey
The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
Small embeddings for partial 5-cycle systems
Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
On the coequal values of total chromatic number and chromatic index
Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
Using the minimum maximum flow degree to approximate the flow coloring problem
Vizing's coloring algorithm and the fan number
A survey on the cyclic coloring and its relaxations
Decomposition of class II graphs into two class I graphs
A brief history of edge-colorings -- with personal reminiscences

This page was built for publication: A Theorem on Coloring the Lines of a Network

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