scientific article; zbMATH DE number 3654142

Cited in

(only showing first 100 items - show all)

The hunting of a snark with total chromatic number 5
Hamiltonian cycles in critical graphs with large maximum degree
Edge and total coloring of interval graphs
On equitable coloring of central graphs and total graphs
Overfullness of edge‐critical graphs with small minimal core degree
Decompositions for edge-coloring join graphs and cobipartite graphs
A tutorial on graph models for scheduling round‐robin sports tournaments
Chromatic index of dense quasirandom graphs
Some models of graphs for scheduling sports competitions
Overfullness of critical class 2 graphs with a small core degree
Minimal edge colorings of class 2 graphs and double graphs
Optimally edge-colouring outerplanar graphs is in NC
Double graphs
A theorem in edge colouring
Complete graphs without polychromatic circuits
The edge-chromatic class of regular graphs of degree 4 and their complements
Hamiltonian cycles in the cartesian product of a tree and a cycle
Blocking versus nonblocking interprocess communication: A note on the effect on concurrency
Chromatic index critical graphs of order 9
The 1-factorization of some line-graphs
2-3 graphs which have Vizing's adjacency property
The maximum edge-disjoint paths problem in complete graphs
Regular graphs and edge chromatic number
Graph factors and factorization: 1985--2003: a survey
The chromatic index of graphs of high maximum degree
On graphs critical with respect to edge-colourings
Approximating the max-edge-coloring problem
Edge coloring graphs with large minimum degree
Some upper bounds on the total and list chromatic numbers of multigraphs
Hajós' conjecture for line graphs
3- and 4-critical graphs of small even order
Graph edge coloring: a survey
Edge Coloring of Split Graphs
Distributed link scheduling in wireless networks
The list-chromatic index of \(K_6\)
The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
Totally odd immersions in line graphs
An adjacency Lemma for critical multigraphs
On the chromatic forcing number of a random graph
Handling symmetries in mixed-integer semidefinite programs
A polyhedral approach to edge coloring
A Möbius-type gluing technique for obtaining edge-critical graphs
Extending fixed vertex-colourings to total colourings
The average degree of an edge-chromatic critical graph
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
Special first order systems in Clifford analysis and resolutions.
Some sufficient conditions for a planar graph of maximum degree six to be Class 1
Edge-coloured complete graphs: Connectedness of some subgraphs
scientific article; zbMATH DE number 7145382 (Why is no real title available?)
Edge colouring line graphs of unicyclic graphs
On the size of critical graphs with maximum degree 8
Decompositions of triangle-free 5-regular graphs into paths of length five
A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture
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
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

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)