A Theorem on Coloring the Lines of a Network

Cited in

(only showing first 100 items - show all)

Achieving maximum chromatic index in multigraphs
Efficient algorithms for wavelength assignment on trees of rings
On Vizing's bound for the chromatic index of a multigraph
Edge and vertex intersection of paths in a tree
Decomposition by clique separators
The chromatic index of nearly bipartite multigraphs
Applications of edge coloring of multigraphs to vertex coloring of graphs
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
Extension from precoloured sets of edges
On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
Graph edge coloring: a survey
Chromatic index determined by fractional chromatic index
Some applications of Vizing's theorem to vertex colorings of graphs
An application of matching theory of edge-colourings
The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)
Chromatic index of simple hypergraphs
Measurable versions of Vizing's theorem
On the complexity of the smallest grammar problem over fixed alphabets
Facial visibility in edge colored plane graphs
Vizing's and Shannon's theorems for defective edge colouring
On the coequal values of total chromatic number and chromatic index
Bounds for the rainbow disconnection numbers of graphs
Edge-coloring of plane multigraphs with many colors on facial cycles
On the cyclic coloring conjecture
A survey on the cyclic coloring and its relaxations
On the fg-coloring of graphs
Goldberg's conjecture is true for random multigraphs
Algorithms for data migration
Facially-constrained colorings of plane graphs: a survey
Facial rainbow edge-coloring of plane graphs
Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
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
Path problems in generalized stars, complete graphs, and brick wall graphs
Edge coloring multigraphs without small dense subsets
Colouring the edges of a multigraph
Edge-coloring of multigraphs
Using the minimum maximum flow degree to approximate the flow coloring problem
Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
Generalized edge-colorings of weighted graphs
The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
Small embeddings for partial 5-cycle systems
Hadwiger's conjecture for -link graphs
Vizing's coloring algorithm and the fan number
Facial non-repetitive edge-coloring of plane graphs
On characterizing Vizing's edge colouring bound
Facial packing edge-coloring of plane graphs
Edge-coloring of multigraphs: Recoloring technique
Coloring quasi-line graphs
Bounding χ in terms of ω and Δ for quasi-line graphs
A generalization of edge-coloring in graphs
Some upper bounds on the total and list chromatic numbers of multigraphs
Networks communicating for each pairing of terminals
scientific article; zbMATH DE number 3580563 (Why is no real title available?)
A bibliographic survey of edge‐colorings
The edge chromatic number of a directed/mixed multigraph
scientific article; zbMATH DE number 1523257 (Why is no real title available?)
Improved bounds for the chromatic index of graphs and multigraphs
Facial edge ranking of plane graphs
scientific article; zbMATH DE number 6965186 (Why is no real title available?)
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
On the edge multicoloring of unicyclic graphs
A combined logarithmic bound on the chromatic index of multigraphs
Short fans and the 5/6 bound for line graphs
Obituary: Claude Elwood Shannon 1916-2001
On fans in multigraphs
Interval non-edge-colorable bipartite graphs and multigraphs
Two Chromatic Conjectures: One for Vertices and One for Edges
scientific article; zbMATH DE number 3378939 (Why is no real title available?)
scientific article; zbMATH DE number 3405975 (Why is no real title available?)
A brief history of edge-colorings -- with personal reminiscences
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
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
Bounds for the chromatic index of signed multigraphs
Approximating the chromatic index of multigraphs
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
Tree-like distance colouring for planar graphs of sufficient girth
On the fractional matching polytope of a hypergraph
A characterization of multigraphs reaching Goldberg's bound of chromatic index
The chromatic index of hypergraphs with no intersecting multiple 2-edges
Low-memory algorithms for online edge coloring
Streaming edge coloring with subquadratic palette size
Boundedness for proper conflict-free and odd colorings
On the (1, 2⁵)-packing edge-colorings of claw-free subcubic graphs
Proof of the Goldberg-Seymour conjecture on edge-colorings of multigraphs
Graph theory. Abstracts from the workshop held January 5--10, 2025

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)