The following pages link to (Q5181716):
Displayed 19 items.
- Some sufficient conditions for a graph to be of \(C_f\) 1 (Q812743) (← links)
- A note on the Erdős--Farber--Lovász conjecture (Q868363) (← links)
- A \(\Delta\)-subgraph condition for a graph to be class 1 (Q1087551) (← links)
- Edge-colouring random graphs (Q1109790) (← links)
- Class one graphs (Q1112066) (← links)
- 1-factorizing regular graphs of high degree - an improved bound (Q1121901) (← links)
- Obstructions for regular colorings (Q1160139) (← links)
- Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) (← links)
- The chromatic index of a graph whose core has maximum degree two (Q1197023) (← links)
- Some remarks on good colorations (Q1216325) (← links)
- An extension of bipartite multigraphs (Q1220938) (← links)
- Multigraphs with quasiweak odd cycles (Q1245852) (← links)
- Lower bounds on the cover-index of a graph (Q1255966) (← links)
- A sufficient condition for equitable edge-colourings of simple graphs (Q1322183) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- Chromatic index of hypergraphs and Shannon's theorem (Q1580680) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
- Total chromatic number of one kind of join graphs (Q2501562) (← links)