A Theorem on Coloring the Lines of a Network

Cited In (only showing first 100 items - show all)

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

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)