On the chromatic index of multigraphs without large triangles
From MaRDI portal
Recommendations
- On the chromatic number of triangle-free graphs of large minimum degree
- Triangle-free graphs with large chromatic numbers
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- scientific article; zbMATH DE number 4122017
- A note concerning the chromatic index of multigraphs
- The chromatic index of multigraphs that are nearly full
- On the chromatic index of almost all graphs
- scientific article; zbMATH DE number 3918395
- Approximating the chromatic index of multigraphs
- On the upper chromatic index of a multigraph
Cites work
- CHROMATIC BOUNDS FOR A CLASS OF GRAPHS
- scientific article; zbMATH DE number 3643303 (Why is no real title available?)
- Multicoloring the incidentors of a weighted directed multigraph
- Note on Choudum's “chromatic bounds for a class of graphs”
- Some applications of Vizing's theorem to vertex colorings of graphs
Cited in
(31)- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- Achieving maximum chromatic index in multigraphs
- The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)
- Applications of edge coloring of multigraphs to vertex coloring of graphs
- On the chromatic number of a graph with two forbidden subgraphs
- Claw-free graphs---a survey
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- A coloring algorithm for \(4 K_1\)-free line graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Graph edge coloring: a survey
- Chromatic index determined by fractional chromatic index
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- Clique covers and coloring problems of graphs
- Average degrees of edge-chromatic critical graphs
- Edge coloring multigraphs without small dense subsets
- Vizing bound for the chromatic number on some graph classes
- Overfullness of critical class 2 graphs with a small core degree
- Maximum -edge-colorable subgraphs of class II graphs
- On a limit of the method of Tashkinov trees for edge-colouring
- On characterizing Vizing's edge colouring bound
- Densities, matchings, and fractional edge-colorings
- A brief history of edge-colorings -- with personal reminiscences
- Double Vizing fans in critical class two graphs
- On multichromatic numbers of widely colorable graphs
- Tashkinov-trees: an annotated proof
- Approximating the chromatic index of multigraphs
- Kempe classes and almost bipartite graphs
- Proof of the Goldberg-Seymour conjecture on edge-colorings of multigraphs
- On graphs with no induced P₅ or K₅-e
- -boundedness and related problems on graphs without long induced paths: a survey
- Odd clique minors and chromatic bounds of {\(3K_1\), paraglider}-free graphs
This page was built for publication: On the chromatic index of multigraphs without large triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794661)