Pages that link to "Item:Q3893954"
From MaRDI portal
The following pages link to The chromatic index of graphs with a spanning star (Q3893954):
Displaying 32 items.
- On the chromatic index of cographs and join graphs (Q324879) (← links)
- Chromatic index critical graphs of order 9 (Q787152) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- Decompositions for edge-coloring join graphs and cobipartite graphs (Q987682) (← links)
- Critical star multigraphs (Q1089350) (← links)
- On edge-colouring indifference graphs (Q1391299) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- On the \(\rho \)-edge stability number of graphs (Q2062684) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- A computational complexity comparative study of graph tessellation problems (Q2222093) (← links)
- Upper bounds on the maximum degree of class two graphs on surfaces (Q2286600) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- AVD-edge coloring on powers of paths (Q2413184) (← links)
- Hamilton cycle rich 2-factorizations of complete multipartite graphs (Q2482354) (← 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)
- Edge Coloring of Split Graphs (Q3503526) (← links)
- Grooming for two-period optical networks (Q3548732) (← links)
- Graphs which are vertex-critical with respect to the edge-chromatic number (Q3767367) (← links)
- Colourings of (k-r,k)-trees (Q4690980) (← links)
- On edge-colouring indifference graphs (Q5096339) (← links)
- Graphs which are vertex‐critical with respect to the edge‐chromatic class (Q5203049) (← links)
- (Q5708515) (← links)
- Edge and total coloring of interval graphs (Q5954080) (← links)
- The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← 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)
- Proper rainbow-cycle-forbidding edge colorings of graphs (Q6644900) (← links)
- New results on edge-coloring and total-coloring of split graphs (Q6648272) (← links)
