Graph edge coloring: a survey (Q1733850)

From MaRDI portal

Revision as of 06:40, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Graph edge coloring: a survey

scientific article

Language	Label	Description	Also known as
English	Graph edge coloring: a survey	scientific article

Statements

scholarly article

0 references

Graph edge coloring: a survey (English)

0 references

0 references

0 references

0 references

Michael Stiebitz

0 references

0 references

Graphs and Combinatorics

0 references

publication date

21 March 2019

0 references

zbMATH Keywords

chromatic index

0 references

edge coloring

0 references

adjacency lemma

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00373-018-1986-5

0 references

The chromatic index of a graph whose core has maximum degree 2

0 references

The chromatic index of a graph whose core is a cycle of order at most 13

0 references

The chromatic index of a claw-free graph whose core has maximum degree 2

0 references

On edge-colorings of graphs.

0 references

On a limit of the method of Tashkinov trees for edge-colouring

0 references

0 references

Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs

0 references

0 references

Chromatic index, treewidth and maximum degree

0 references

NP-completeness of edge-colouring some restricted graphs

0 references

Average degrees of edge-chromatic critical graphs

0 references

Hamiltonicity of edge-chromatic critical graphs

0 references

Colouring the petals of a graph

0 references

Chromatic index determined by fractional chromatic index

0 references

Vizing's 2‐Factor Conjecture Involving Large Maximum Degree

0 references

Approximating the chromatic index of multigraphs

0 references

Densities, Matchings, and Fractional Edge-Colorings

0 references

A note on the size of edge-chromatic 4-critical graphs

0 references

Regular Graphs of High Degree are 1-Factorizable

0 references

1-factorizing regular graphs of high degree - an improved bound

0 references

Edge-colouring seven-regular planar graphs

0 references

Edge-colouring eight-regular planar graphs

0 references

Subcubic Edge‐Chromatic Critical Graphs Have Many Edges

0 references

Short Fans and the 5/6 Bound for Line Graphs

0 references

The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4

0 references

Proof of the 1-factorization and Hamilton Decomposition Conjectures

0 references

Packing six \(T\)-joins in plane graphs

0 references

Maximum matching and a polyhedron with 0,1-vertices

0 references

Extension from precoloured sets of edges

0 references

Three-edge-colouring doublecross cubic graphs

0 references

On the chromatic index of almost all graphs

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Edge-coloring of multigraphs: Recoloring technique

0 references

Chromatic-index critical multigraphs of order 20

0 references

On the chromatic index and the cover index of a multigraph

0 references

List-edge-colouring planar graphs with precoloured edges

0 references

Edge coloring multigraphs without small dense subsets

0 references

Goldberg's conjecture is true for random multigraphs

0 references

On characterizing Vizing's edge colouring bound

0 references

0 references

A better than “best possible” algorithm to edge color multigraphs

0 references

The NP-Completeness of Edge-Coloring

0 references

Planar graphs of maximum degree six without 7-cycles are class one

0 references

On critical graphs with chromatic index 4

0 references

0 references

0 references

Remarks on planar edge-chromatic critical graphs

0 references

Asymptotics of the chromatic index for multigraphs

0 references

Vizing's 2-factor conjecture involving toughness and maximum degree conditions

0 references

On the chromatic index of multigraphs without large triangles

0 references

A new tool for proving Vizing's theorem

0 references

Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees

0 references

Hamiltonian cycles in critical graphs with large maximum degree

0 references

A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture

0 references

Decompositions for edge-coloring join graphs and cobipartite graphs

0 references

Edge-colouring and total-colouring chordless graphs

0 references

Optimal edge-colourings for a class of planar multigraphs

0 references

Extending an edge-coloring

0 references

On a theorem of Goldberg

0 references

On the size of edge-coloring critical graphs with maximum degree 4

0 references

On the average degree of critical graphs with maximum degree six

0 references

0 references

Edge coloring of planar graphs which any two short cycles are adjacent at most once

0 references

On the $1.1$ Edge-Coloring of Multigraphs

0 references

On the independence number of edge chromatic critical graphs

0 references

Edge coloring regular graphs of high degree

0 references

A Combined Logarithmic Bound on the Chromatic Index of Multigraphs

0 references

All regular multigraphs of even order and high degree are 1-factorable

0 references

Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture

0 references

Ein Sechsfarbenproblem auf der Kugel

0 references

The four-colour theorem

0 references

Tutte's edge-colouring conjecture

0 references

Excluded minors in cubic graphs

0 references

An asymptotic approximation scheme for multigraph edge coloring

0 references

Planar graphs of maximum degree seven are Class I

0 references

Graph edge colouring: Tashkinov trees and Goldberg's conjecture

0 references

On Vizing's bound for the chromatic index of a multigraph

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte

0 references

On Tutte's extension of the four-colour problem

0 references

Colouring series-parallel graphs

0 references

A Theorem on Coloring the Lines of a Network

0 references

Edge-colouring of joins of regular graphs. II

0 references

Approximating Vizing's independence number conjecture

0 references

0 references

On the algebraic theory of graph colorings

0 references

A conjecture on triangles of graphs

0 references

An Asymptotic Version of the Multigraph 1‐Factorization Conjecture

0 references

0 references

SOME UNSOLVED PROBLEMS IN GRAPH THEORY

0 references

Edge coloring of graphs embedded in a surface of nonnegative characteristic

0 references

A sufficient condition for a plane graph with maximum degree 6 to be class 1

0 references

The average degree of an edge‐chromatic critical graph II

0 references

The independence number of an edge-chromatic critical graph

0 references

Edge colorings of planar graphs without 5-cycles with two chords

0 references

Every planar graph with maximum degree 7 is of class 1

0 references

Some sufficient conditions for 1-planar graphs to be class 1

0 references

Edge coloring of planar graphs without adjacent 7-cycles

0 references

The edge chromatic number of outer-1-planar graphs

0 references

On edge colorings of 1-planar graphs without adjacent triangles

0 references

0 references

On edge colorings of \(1\)-planar graphs

0 references

On the chromatic index of join graphs and triangle-free graphs with large maximum degree

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S00373-018-1986-5

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1733850

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1733850&oldid=38719753"