scientific article; zbMATH DE number 3654142

zbMATH Open0421.05023MaRDI QIDQ3853641FDOQ3853641

Publication date: 1977

Title of this publication is not available (Why is that?)

classification problem chromatic index Vizing's theorem edge-colourings of graphs

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)

Cited In (only showing first 100 items - show all)

Color-character of uncolorable cubic graphs
The chromatic index of a graph whose core has maximum degree two
Edge colorings of planar graphs without 5-cycles with two chords
The edge chromatic number of a directed/mixed multigraph
The size of edge chromatic critical graphs with maximum degree 6
Note sur la non existence d'un snark d'ordre 16
Snarks of order 18
Forwarding and optical indices of a graph
A comparison of two edge-coloring formulations
Hadwiger's conjecture and inflations of the Petersen graph
Injective colorings of sparse graphs
A generalization of chromatic index
NP-completeness of edge-colouring some restricted graphs
Critical star multigraphs
Recent progress on edge-colouring graphs
Hamilton weights and Petersen minors
Chromatic-index-critical graphs of orders 13 and 14
Characterizing and edge-colouring split-indifference graphs
Parsimonious edge coloring
On purely tree-colorable planar graphs
A homology theory for colored graphs
The average degree of edge chromatic critical graphs with maximum degree seven
Clique covers and coloring problems of graphs
Cores of class II graphs
Edge colorings of graphs embeddable in a surface of low genus
Polynomial time complexity of edge colouring graphs with bounded colour classes
A generalization of edge-coloring in graphs
Class one graphs
Improving a family of approximation algorithms to edge color multigraphs
A note on the size of edge-chromatic 4-critical 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
Berge-Fulkerson conjecture on certain snarks
Incidence and strong edge colorings of graphs
Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
Some criteria for a graph to be class 1
The total chromatic number of graphs of even order and high degree
Hamiltonian paths in vertex-symmetric graphs of order 5p
Parallel concepts in graph theory
Parallel O(log n) time edge-colouring of trees and Halin graphs
Average degrees of edge-chromatic critical graphs
Trees with maximum nullity
On the equivalence covering number of splitgraphs
Classification and characterizations of snarks
Unique Fulkerson coloring of Petersen minor-free cubic graphs
Construction of class two graphs with maximum vertex degree three
The tournament scheduling problem with absences
Measures of edge-uncolorability of cubic graphs
On the average degree of edge chromatic critical graphs
A \(\Delta\)-subgraph condition for a graph to be class 1
Even polyhedral decompositions of cubic graphs
Remarks on the size of critical edge-chromatic graphs
On the intricacy of combinatorial construction problems
On the size of edge chromatic critical graphs
Proof of the list edge coloring conjecture for complete graphs of prime degree
On the size of critical graphs with small maximum degree
Edge and total coloring of interval graphs
The hunting of a snark with total chromatic number 5
A tutorial on graph models for scheduling round‐robin sports tournaments
On equitable coloring of central graphs and total graphs
Hamiltonian cycles in critical graphs with large maximum degree
Decompositions for edge-coloring join graphs and cobipartite graphs
Some models of graphs for scheduling sports competitions
Double graphs
Chromatic index critical graphs of order 9
Graph factors and factorization: 1985--2003: a survey
Approximating the max-edge-coloring problem
Some upper bounds on the total and list chromatic numbers of multigraphs
3- and 4-critical graphs of small even order
Hajós' conjecture for line 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
The average degree of an edge-chromatic critical graph
Some sufficient conditions for a planar graph of maximum degree six to be Class 1
A polyhedral approach to edge coloring
Special first order systems in Clifford analysis and resolutions.
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
Edge-coloured complete graphs: Connectedness of some subgraphs
A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture
Decompositions of triangle-free 5-regular graphs into paths of length five
Simple reduction of f-colorings to edge-colorings
On the size of critical graphs with maximum degree 8
Edge colouring line graphs of unicyclic graphs
On edge-colouring indifference graphs
Data transfers in networks with transceivers
Generalized handles in graphs and connected sums of manifolds
The achromatic indices of the regular complete multipartite graphs
Reverse class critical multigraphs
A parallel algorithm for edge-coloring partial k-trees
Combinatorics in glass
Frustration and overblocking on graphs
Remarks on the critical graph conjecture
Edge-colouring random graphs
Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
A construction of chromatic index critical graphs
The edge chromatic difference sequence of a cubic graph
On total and edge coloring some Kneser graphs
Algorithms for finding f-colorings of partial k-trees

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)