A generalization of edge-coloring in graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(88)- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- Data transfers in networks
- Generalized edge theorem
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
- A generalization of chromatic index
- A sufficient condition for equitable edge-colourings of simple graphs
- On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
- On resolving edge colorings in graphs
- Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\)
- Some results on an edge coloring problem of Folkman and Fulkerson
- Spectrum graph coloring and applications to Wi-Fi channel assignment
- On \(f\)-colorings of nearly bipartite graphs
- The classification of \(f\)-coloring of graphs with large maximum degree
- Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
- Graphs of \(f\)-class 1
- A Vizing-type theorem for matching forests
- Edge dominating set and colorings on graphs with fixed clique-width
- An application of matching theory of edge-colourings
- A refinement of Vizing's theorem
- Coloring Delaunay-edges and their generalizations
- Fractional \(f\)-edge cover chromatic index of graphs
- Vizing's and Shannon's theorems for defective edge colouring
- Edge coloring of the signed generalized Petersen graph
- Vertex colourings of multigraphs with forbiddances on edges
- A classification of edge-colored graphs based on properly colored walks
- On the fg-coloring of graphs
- A note on the simultaneous edge coloring
- On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs
- The method of coloring in graphs and its application
- Kőnig's edge-colouring theorem for all graphs
- f-class two graphs whose f-cores have maximum degree two
- Some properties on f-edge covered critical graphs
- An edge colouring of multigraphs
- Some graphs of class 1 for \(f\)-colorings
- Edge-coloring of multigraphs
- The classification of complete graphs \(K_n\) on \(f\)-coloring
- Reachability problems in edge-colored digraphs
- Edge-colorings of some large graphs on alphabets
- Homogeneous edge-colorings of graphs
- Kőnig's line coloring and Vizing's theorems for graphings
- On the fractional f-chromatic index of a graph
- Equitable edge-colorings of simple graphs
- On characterizing Vizing's edge colouring bound
- scientific article; zbMATH DE number 3861194 (Why is no real title available?)
- A short proof for a generalization of Vizing's theorem
- Some class 1 graphs on \(g_c\)-colorings
- A note on M2-edge colorings of graphs
- scientific article; zbMATH DE number 3914343 (Why is no real title available?)
- scientific article; zbMATH DE number 3970777 (Why is no real title available?)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
- Edge-colouring and total-colouring chordless graphs
- scientific article; zbMATH DE number 30752 (Why is no real title available?)
- scientific article; zbMATH DE number 68344 (Why is no real title available?)
- Edge-Coloring and f-Coloring for Various Classes of Graphs
- scientific article; zbMATH DE number 1052826 (Why is no real title available?)
- Improved bounds for the chromatic index of graphs and multigraphs
- scientific article; zbMATH DE number 2097452 (Why is no real title available?)
- scientific article; zbMATH DE number 857653 (Why is no real title available?)
- 随机图的$f$-染色的分类 II
- A parallel algorithm for edge-coloring partial k-trees
- On edge-colouring indifference graphs
- On super \(f\)-edge cover-coloring in multigraphs
- Some results on the \(f\)-chromatic index of graphs whose \(f\)-core has maximum degree 2
- On thef-matching polytope and the fractionalf-chromatic index
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
- On fans in multigraphs
- On a theorem about vertex colorings of graphs
- Coloring numbers
- Polychromatic colorings of plane graphs
- Simple reduction of f-colorings to edge-colorings
- Orientation‐based edge‐colorings and linear arboricity of multigraphs
- On an f-coloring generalization of linear arboricity of multigraphs
- Algorithms for finding f-colorings of partial k-trees
- Local version of Vizing's theorem for multigraphs
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
- Some sufficient conditions for a graph to be of \(C_f\) 1
- Some generalizations of theorems on vertex coloring
- Generalised acyclic edge colourings of graphs with large girth
- \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
- The chromatic index of multigraphs that are nearly full
- An adjacency Lemma for critical multigraphs
- f-colorings of some graphs of f-class 1
- A special \(f\)-edge cover-coloring of multigraphs
- A note on the \((g, f)\)-coloring
- Edge colouring by total labellings
- Some consequences of a theorem on fans
- Edge covered critical multigraphs
- A note on the edge cover chromatic index of multigraphs
This page was built for publication: A generalization of edge-coloring in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735724)
