Pages that link to "Item:Q5790769"
From MaRDI portal
The following pages link to A Theorem on Coloring the Lines of a Network (Q5790769):
Displaying 50 items.
- Facial packing edge-coloring of plane graphs (Q313797) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
- On the fractional matching polytope of a hypergraph (Q684403) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- A new method of proving theorems on chromatic index (Q801928) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Mono-multi bipartite Ramsey numbers, designs, and matrices (Q817616) (← links)
- Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI (Q858297) (← links)
- Independence in 5-uniform hypergraphs (Q898167) (← links)
- The maximum edge-disjoint paths problem in complete graphs (Q930909) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture (Q968455) (← links)
- Achieving maximum chromatic index in multigraphs (Q1025461) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- The chromatic index of nearly bipartite multigraphs (Q1076034) (← links)
- Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
- Small transversals in hypergraphs (Q1193529) (← links)
- Lower bounds on the cover-index of a graph (Q1255966) (← links)
- A sublinear bound on the chromatic index of multigraphs (Q1301715) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- List edge and list total colourings of multigraphs (Q1366604) (← links)
- Short solution of Kotzig's problem for bipartite graphs (Q1569037) (← links)
- Chromatic index of hypergraphs and Shannon's theorem (Q1580680) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Chromatic index determined by fractional chromatic index (Q1748268) (← links)
- Some applications of Vizing's theorem to vertex colorings of graphs (Q1839256) (← links)
- An application of matching theory of edge-colourings (Q1923520) (← links)
- The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) (Q1926022) (← links)
- Chromatic index of simple hypergraphs (Q2005680) (← links)
- Measurable versions of Vizing's theorem (Q2006081) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Facial visibility in edge colored plane graphs (Q2062889) (← links)
- Vizing's and Shannon's theorems for defective edge colouring (Q2094863) (← links)
- On the coequal values of total chromatic number and chromatic index (Q2101175) (← links)
- Bounds for the rainbow disconnection numbers of graphs (Q2115196) (← links)
- Edge-coloring of plane multigraphs with many colors on facial cycles (Q2185732) (← links)
- On the cyclic coloring conjecture (Q2214053) (← links)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- On the fg-coloring of graphs (Q2277478) (← links)
- Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
- Algorithms for data migration (Q2379927) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Facial rainbow edge-coloring of plane graphs (Q2413633) (← links)
