Pages that link to "Item:Q5187310"
From MaRDI portal
The following pages link to The chromatic index of graphs of even order with many edges (Q5187310):
Displaying 27 items.
- The chromatic index of a graph whose core is a cycle of order at most 13 (Q742593) (← links)
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small (Q752723) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- The chromatic index of multigraphs that are nearly full (Q910411) (← links)
- Chromatic coloring with a maximum color class (Q998433) (← links)
- The chromatic index of nearly bipartite multigraphs (Q1076034) (← links)
- A \(\Delta\)-subgraph condition for a graph to be class 1 (Q1087551) (← links)
- Critical star multigraphs (Q1089350) (← links)
- Recent progress on edge-colouring graphs (Q1090683) (← links)
- Two conjectures on edge-colouring (Q1123197) (← links)
- How to find overfull subgraphs in graphs with large maximum degree (Q1329811) (← links)
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge (Q1690237) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- Edge-colouring of joins of regular graphs. II (Q1945699) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Chromatic index critical graphs of even order with five major vertices (Q2484161) (← links)
- Chromatic-index-critical graphs of orders 13 and 14 (Q2570100) (← links)
- On the chromatic index of graphs with \(2m+1\) vertices and \(2m^2\) edges. (Q2583545) (← links)
- (Q3300194) (← links)
- Graphs which are vertex-critical with respect to the edge-chromatic number (Q3767367) (← links)
- On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs (Q4271622) (← links)
- Graphs which are vertex‐critical with respect to the edge‐chromatic class (Q5203049) (← links)
- The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← links)
- The mod k $k$ chromatic index of graphs is O(k) $O(k)$ (Q6093146) (← links)
- Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs (Q6145813) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
- On the chromatic index of complementary prisms (Q6621267) (← links)
