scientific article; zbMATH DE number 3654142

Cited in

(only showing first 100 items - show all)

Edge colorings of planar graphs without 5-cycles with two chords
Color-character of uncolorable cubic graphs
Simple reduction of f-colorings to edge-colorings
The chromatic index of a graph whose core has maximum degree two
Note sur la non existence d'un snark d'ordre 16
Forwarding and optical indices of a graph
Snarks of order 18
On edge-colouring indifference graphs
The edge chromatic number of a directed/mixed multigraph
Generalized handles in graphs and connected sums of manifolds
Data transfers in networks with transceivers
The size of edge chromatic critical graphs with maximum degree 6
A comparison of two edge-coloring formulations
The achromatic indices of the regular complete multipartite graphs
Hadwiger's conjecture and inflations of the Petersen graph
Injective colorings of sparse graphs
Reverse class critical multigraphs
A generalization of chromatic index
Combinatorics in glass
Frustration and overblocking on graphs
NP-completeness of edge-colouring some restricted graphs
Critical star multigraphs
Recent progress on edge-colouring graphs
Remarks on the critical graph conjecture
A parallel algorithm for edge-coloring partial k-trees
Edge-colouring random graphs
Chromatic-index-critical graphs of orders 13 and 14
Hamilton weights and Petersen minors
Characterizing and edge-colouring split-indifference graphs
Indicated coloring of some families of graphs
Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
Parsimonious edge coloring
On purely tree-colorable planar graphs
The edge chromatic difference sequence of a cubic graph
A homology theory for colored graphs
Labeling angles of planar graphs
On total and edge coloring some Kneser graphs
A construction of chromatic index critical graphs
Edge colorings of planar graphs without 6-cycles with three chords
Clique covers and coloring problems of graphs
The average degree of edge chromatic critical graphs with maximum degree seven
Algorithms for finding f-colorings of partial k-trees
Edge colorings of graphs embeddable in a surface of low genus
Cores of class II graphs
The chromatic index of a claw-free graph whose core has maximum degree 2
Polynomial time complexity of edge colouring graphs with bounded colour classes
On the equitable edge-coloring of 1-planar graphs and planar graphs
Graph polynomials: some questions on the edge
Improving a family of approximation algorithms to edge color multigraphs
A note on the size of edge-chromatic 4-critical graphs
A generalization of edge-coloring in graphs
On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
Class one graphs
On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index
The tree number of a graph with a given girth
Adjacent strong edge coloring of graphs
On the size of edge chromatic 5-critical graphs
Berge-Fulkerson conjecture on certain snarks
Incidence and strong edge colorings of graphs
Some criteria for a graph to be class 1
Data transfers in networks with transceivers
The complexity of list edge-partitions for simple graphs
Note on a conjecture of Toft
The total chromatic number of graphs of even order and high degree
Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
Edge coloring of planar graphs without adjacent 7-cycles
There are no edge-chromatic 4-critical graphs of order 12
Hamiltonian paths in vertex-symmetric graphs of order 5p
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
Lins-Mandel crystallizations
Parallel concepts in graph theory
The cochromatic index of a graph
Parallel O(log n) time edge-colouring of trees and Halin graphs
Some bound of the edge chromatic surplus of certain cubic graphs
scientific article; zbMATH DE number 3966100 (Why is no real title available?)
On the equivalence covering number of splitgraphs
Average degrees of edge-chromatic critical graphs
Trees with maximum nullity
Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
Classification and characterizations of snarks
A brief history of edge-colorings -- with personal reminiscences
Unique Fulkerson coloring of Petersen minor-free cubic graphs
The chromatic index of a graph whose core is a cycle of order at most 13
The tournament scheduling problem with absences
Measures of edge-uncolorability of cubic graphs
Construction of class two graphs with maximum vertex degree three
A \(\Delta\)-subgraph condition for a graph to be class 1
On the average degree of edge chromatic critical graphs
Even polyhedral decompositions of cubic graphs
The overfullness of graphs with small minimum degree and large maximum degree
Decompositions of graphs into forests with bounded maximum degree
Remarks on the size of critical edge-chromatic graphs
On the intricacy of combinatorial construction problems
On the size of edge chromatic critical graphs
An analogy between edge colourings and differentiable manifolds, with a new perspective on 3-critical graphs
New results on chromatic index critical graphs
Isomorphic factorization of r-regular graphs into r parts
The core conjecture of Hilton and Zhao
Proof of the list edge coloring conjecture for complete graphs of prime degree
On the fg-coloring of graphs

This page was built for publication:

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