scientific article

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

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

Related Items (only showing first 100 items - show all)

Efficient Vertex- and Edge-Coloring of Outerplanar Graphs ⋮ Hamilton weights and Petersen minors ⋮ A parallel algorithm for edge-coloring partial k-trees ⋮ Unnamed Item ⋮ A generalization of edge-coloring in graphs ⋮ On total and edge coloring some Kneser graphs ⋮ On the size of critical graphs with small maximum degree ⋮ Chromatic index of dense quasirandom graphs ⋮ A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture ⋮ On the equitable edge-coloring of 1-planar graphs and planar graphs ⋮ On the size of edge chromatic 5-critical graphs ⋮ Some upper bounds on the total and list chromatic numbers of multigraphs ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Overfullness of critical class 2 graphs with a small core degree ⋮ A tutorial on graph models for scheduling round‐robin sports tournaments ⋮ Handling symmetries in mixed-integer semidefinite programs ⋮ The average degree of edge chromatic critical graphs with maximum degree seven ⋮ Simple reduction of f-colorings to edge-colorings ⋮ Edge Coloring of Split Graphs ⋮ Edge coloring graphs with large minimum degree ⋮ Cores of class II graphs ⋮ Totally odd immersions in line graphs ⋮ The core conjecture of Hilton and Zhao ⋮ Overfullness of edge‐critical graphs with small minimal core degree ⋮ The list-chromatic index of \(K_6\) ⋮ The hunting of a snark with total chromatic number 5 ⋮ On the average degree of edge chromatic critical graphs ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable ⋮ Double graphs ⋮ The average degree of an edge-chromatic critical graph ⋮ Polynomial time complexity of edge colouring graphs with bounded colour classes ⋮ Average degrees of edge-chromatic critical graphs ⋮ Some sufficient conditions for a planar graph of maximum degree six to be Class 1 ⋮ Algorithms for finding f-colorings of partial k-trees ⋮ On the fg-coloring of graphs ⋮ Edge and total coloring of interval graphs ⋮ The size of edge chromatic critical graphs with maximum degree 6 ⋮ The edge chromatic number of a directed/mixed multigraph ⋮ Berge-Fulkerson conjecture on certain snarks ⋮ Unnamed Item ⋮ On edge-colouring indifference graphs ⋮ On Equitable Coloring of Central Graphs and Total Graphs ⋮ A Möbius-type gluing technique for obtaining edge-critical graphs ⋮ Data transfers in networks with transceivers ⋮ Data transfers in networks with transceivers ⋮ A construction of chromatic index critical graphs ⋮ Chromatic-index-critical graphs of orders 13 and 14 ⋮ Some bound of the edge chromatic surplus of certain cubic graphs ⋮ Distributed link scheduling in wireless networks ⋮ Minimal edge colorings of class 2 graphs and double graphs ⋮ A brief history of edge-colorings – with personal reminiscences ⋮ The Overfullness of Graphs with Small Minimum Degree and Large Maximum Degree ⋮ 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 purely tree-colorable planar graphs ⋮ A \(\Delta\)-subgraph condition for a graph to be class 1 ⋮ The edge-chromatic class of regular graphs of degree 4 and their complements ⋮ Improving a family of approximation algorithms to edge color multigraphs ⋮ A note on the size of edge-chromatic 4-critical graphs ⋮ Critical star multigraphs ⋮ Recent progress on edge-colouring graphs ⋮ A homology theory for colored graphs ⋮ The achromatic indices of the regular complete multipartite graphs ⋮ There are no edge-chromatic 4-critical graphs of order 12 ⋮ Edge coloring of planar graphs without adjacent 7-cycles ⋮ The tournament scheduling problem with absences ⋮ Reverse class critical multigraphs ⋮ The chromatic index of graphs of high maximum degree ⋮ Note on a conjecture of Toft ⋮ 3- and 4-critical graphs of small even order ⋮ Parallel O(log n) time edge-colouring of trees and Halin graphs ⋮ Hajós' conjecture for line graphs ⋮ On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs ⋮ Remarks on the size of critical edge-chromatic graphs ⋮ Edge-colouring random graphs ⋮ Hamiltonian cycles in critical graphs with large maximum degree ⋮ Some models of graphs for scheduling sports competitions ⋮ Class one graphs ⋮ Parsimonious edge coloring ⋮ Labeling angles of planar graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Edge-coloured complete graphs: Connectedness of some subgraphs ⋮ Generalized handles in graphs and connected sums of manifolds ⋮ 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 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 ⋮ The cochromatic index of a graph ⋮ An analogy between edge colourings and differentiable manifolds, with a new perspective on 3-critical graphs ⋮ Construction of class two graphs with maximum vertex degree three ⋮ On the size of edge chromatic critical graphs ⋮ Even polyhedral decompositions of cubic 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 ⋮ Optimally edge-colouring outerplanar graphs is in NC ⋮ Note sur la non existence d'un snark d'ordre 16 ⋮ Hamiltonian cycles in the cartesian product of a tree and a cycle ⋮ Some criteria for a graph to be class 1

This page was built for publication: