The following pages link to Critical star multigraphs (Q1089350):
Displaying 17 items.
- Recent results on the total chromatic number (Q686483) (← links)
- The chromatic index of multigraphs that are nearly full (Q910411) (← links)
- A theorem in edge colouring (Q1043601) (← links)
- On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
- Recent progress on edge-colouring graphs (Q1090683) (← links)
- Two conjectures on edge-colouring (Q1123197) (← links)
- The Hall number, the Hall index, and the total Hall number of a graph (Q1293202) (← links)
- Vertex-splitting and chromatic index critical graphs (Q1363752) (← links)
- Embedding partial extended triple systems and totally symmetric quasigroups (Q1377692) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Characterization of split graphs with at most four distinct eigenvalues (Q2341775) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)
- Graphs which are vertex-critical with respect to the edge-chromatic number (Q3767367) (← links)
- A note concerning the chromatic index of multigraphs (Q3795693) (← links)
- Graphs which are vertex‐critical with respect to the edge‐chromatic class (Q5203049) (← links)
- (Q5708515) (← links)
