scientific article; zbMATH DE number 3654142

Cited in

(only showing first 100 items - show all)

Forwarding and optical indices of a graph
Color-character of uncolorable cubic graphs
New results on chromatic index critical graphs
A theorem in edge colouring
Complete graphs without polychromatic circuits
The 1-factorization of some line-graphs
Lins-Mandel crystallizations
A \(\Delta\)-subgraph condition for a graph to be class 1
The edge-chromatic class of regular graphs of degree 4 and their complements
Critical star multigraphs
Recent progress on edge-colouring graphs
Reverse class critical multigraphs
Parallel O(log n) time edge-colouring of trees and Halin graphs
Edge-colouring random graphs
Some models of graphs for scheduling sports competitions
Class one graphs
Labeling angles of planar graphs
Edge-coloured complete graphs: Connectedness of some subgraphs
Generalized handles in graphs and connected sums of manifolds
The cochromatic index of a graph
Construction of class two graphs with maximum vertex degree three
Even polyhedral decompositions of cubic graphs
Note sur la non existence d'un snark d'ordre 16
Hamiltonian cycles in the cartesian product of a tree and a cycle
On graphs critical with respect to edge-colourings
Snarks of order 18
Hamiltonian paths in vertex-symmetric graphs of order 5p
NP-completeness of edge-colouring some restricted graphs
A polyhedral approach to edge coloring
Decompositions of graphs into forests with bounded maximum degree
Edge colouring line graphs of unicyclic graphs
The chromatic index of a graph whose core has maximum degree two
Remarks on the critical graph conjecture
Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
A generalization of chromatic index
Incidence and strong edge colorings of graphs
Parallel concepts in graph theory
A homology theory for colored graphs
The chromatic index of graphs of high maximum degree
3- and 4-critical graphs of small even order
On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
Remarks on the size of critical edge-chromatic graphs
The edge chromatic difference sequence of a cubic graph
Extending fixed vertex-colourings to total colourings
Characterizing and edge-colouring split-indifference graphs
On the size of edge chromatic critical graphs
The total chromatic number of graphs of even order and high degree
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
Classification and characterizations of snarks
Edge colorings of graphs embeddable in a surface of low genus
Special first order systems in Clifford analysis and resolutions.
Adjacent strong edge coloring of graphs
Edge coloring of planar graphs without adjacent 7-cycles
Graph edge coloring: a survey
Edge colorings of planar graphs without 6-cycles with three chords
Hadwiger's conjecture and inflations of the Petersen graph
Trees with maximum nullity
2-3 graphs which have Vizing's adjacency property
Clique covers and coloring problems of graphs
Isomorphic factorization of r-regular graphs into r parts
On the chromatic forcing number of a random graph
The achromatic indices of the regular complete multipartite graphs
There are no edge-chromatic 4-critical graphs of order 12
Note on a conjecture of Toft
Parsimonious edge coloring
Average degrees of edge-chromatic critical graphs
On total and edge coloring some Kneser graphs
Chromatic index of dense quasirandom graphs
On the average degree of edge chromatic critical graphs
Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
Polynomial time complexity of edge colouring graphs with bounded colour classes
On the fg-coloring of graphs
Decompositions of triangle-free 5-regular graphs into paths of length five
The chromatic index of a claw-free graph whose core has maximum degree 2
On the equitable edge-coloring of 1-planar graphs and planar graphs
On the size of edge chromatic 5-critical graphs
The list-chromatic index of \(K_6\)
The hunting of a snark with total chromatic number 5
Double graphs
The average degree of an edge-chromatic critical graph
Some sufficient conditions for a planar graph of maximum degree six to be Class 1
Berge-Fulkerson conjecture on certain snarks
Chromatic-index-critical graphs of orders 13 and 14
Overfullness of critical class 2 graphs with a small core degree
On purely tree-colorable planar graphs
On equitable coloring of central graphs and total graphs
On the size of critical graphs with small maximum degree
Improving a family of approximation algorithms to edge color multigraphs
A note on the size of edge-chromatic 4-critical graphs
Minimal edge colorings of class 2 graphs and double graphs
The tournament scheduling problem with absences
Hamiltonian cycles in critical graphs with large maximum degree
Edge Coloring of Split Graphs
The size of edge chromatic critical graphs with maximum degree 6
Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
scientific article; zbMATH DE number 3966100 (Why is no real title available?)
A generalization of edge-coloring in graphs
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 colorings of planar graphs without 5-cycles with two chords

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)