scientific article; zbMATH DE number 3654142

Cited in

(only showing first 100 items - show all)

Chromatic-index-critical graphs of orders 13 and 14
NP-completeness of edge-colouring some restricted graphs
Color-character of uncolorable cubic graphs
The average degree of an edge-chromatic critical graph
3- and 4-critical graphs of small even order
A generalization of chromatic index
Decompositions of triangle-free 5-regular graphs into paths of length five
Hajós' conjecture for line graphs
On the size of critical graphs with small maximum degree
On the equivalence covering number of splitgraphs
Some models of graphs for scheduling sports competitions
Edge colorings of planar graphs without 5-cycles with two chords
Incidence and strong edge colorings of graphs
The chromatic index of a graph whose core has maximum degree two
Graph factors and factorization: 1985--2003: a survey
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
Hamiltonian cycles in critical graphs with large maximum degree
Remarks on the size of critical edge-chromatic graphs
On the size of critical graphs with maximum degree 8
Simple reduction of f-colorings to edge-colorings
Edge and total coloring of interval graphs
Handling symmetries in mixed-integer semidefinite programs
The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
On purely tree-colorable planar graphs
A generalization of edge-coloring in graphs
Some upper bounds on the total and list chromatic numbers of multigraphs
Critical star multigraphs
Recent progress on edge-colouring graphs
Chromatic index critical graphs of order 9
Some sufficient conditions for a planar graph of maximum degree six to be Class 1
Parallel concepts in graph theory
Edge colouring line graphs of unicyclic graphs
Even polyhedral decompositions of cubic graphs
Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
On the intricacy of combinatorial construction problems
Hamiltonian paths in vertex-symmetric graphs of order 5p
Injective colorings of sparse graphs
A polyhedral approach to edge coloring
Characterizing and edge-colouring split-indifference graphs
A homology theory for colored graphs
On the size of edge chromatic critical graphs
Some criteria for a graph to be class 1
Special first order systems in Clifford analysis and resolutions.
Polynomial time complexity of edge colouring graphs with bounded colour classes
A comparison of two edge-coloring formulations
Decompositions for edge-coloring join graphs and cobipartite graphs
The edge chromatic number of a directed/mixed multigraph
Adjacent strong edge coloring of graphs
The hunting of a snark with total chromatic number 5
On the adjacent vertex-distinguishing equitable edge coloring of graphs
Edge coloring of planar graphs which any two short cycles are adjacent at most once
Classification and characterizations of snarks
Parsimonious edge coloring
A tutorial on graph models for scheduling round‐robin sports tournaments
Cores of class II graphs
Hamilton weights and Petersen minors
The total chromatic number of graphs of even order and high degree
Construction of class two graphs with maximum vertex degree three
Parallel O(log n) time edge-colouring of trees and Halin graphs
The tournament scheduling problem with absences
The average degree of edge chromatic critical graphs with maximum degree seven
Edge colorings of graphs embeddable in a surface of low genus
Proof of the list edge coloring conjecture for complete graphs of prime degree
Measures of edge-uncolorability of cubic graphs
Double graphs
Class one graphs
Berge-Fulkerson conjecture on certain snarks
Clique covers and coloring problems of graphs
Note sur la non existence d'un snark d'ordre 16
On equitable coloring of central graphs and total graphs
Improving a family of approximation algorithms to edge color multigraphs
The size of edge chromatic critical graphs with maximum degree 6
A \(\Delta\)-subgraph condition for a graph to be class 1
A note on the size of edge-chromatic 4-critical graphs
On the average degree of edge chromatic critical graphs
Edge-coloured complete graphs: Connectedness of some subgraphs
Average degrees of edge-chromatic critical graphs
Snarks of order 18
A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture
Unique Fulkerson coloring of Petersen minor-free cubic graphs
Hadwiger's conjecture and inflations of the Petersen graph
Forwarding and optical indices of a graph
Approximating the max-edge-coloring problem
Trees with maximum nullity
The maximum edge-disjoint paths problem in complete graphs
Hamiltonian cycles in the cartesian product of a tree and a cycle
Regular graphs and edge chromatic number
The 1-factorization of some line-graphs
Some bound of the edge chromatic surplus of certain cubic graphs
On the fg-coloring of graphs
Generalized handles in graphs and connected sums of manifolds
Blocking versus nonblocking interprocess communication: A note on the effect on concurrency
Edge Coloring of Split Graphs
Edge coloring graphs with large minimum degree
scientific article; zbMATH DE number 7145382 (Why is no real title available?)
The chromatic index of a claw-free graph whose core has maximum degree 2
Decompositions of graphs into forests with bounded maximum degree
A theorem in edge colouring
A construction of chromatic index critical 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)