The following pages link to David Cariolaro (Q602753):
Displayed 24 items.
- (Q442375) (redirect page) (← links)
- Some criteria for a graph to be class 1 (Q442377) (← links)
- Excessive factorizations of bipartite multigraphs (Q602754) (← links)
- An adjacency Lemma for critical multigraphs (Q942112) (← links)
- Covering graphs with matchings of fixed size (Q960925) (← links)
- Some consequences of a theorem on fans (Q971505) (← links)
- A theorem in edge colouring (Q1043601) (← links)
- Excessive near 1-factorizations (Q1044935) (← links)
- An application of Tutte's theorem to 1-factorization of regular graphs of high degree (Q1044942) (← links)
- On the measure of a fuzzy set based on continuous \(t\)-conorms (Q1277857) (← links)
- Colouring the petals of a graph (Q1871369) (← links)
- Polynomial time complexity of edge colouring graphs with bounded colour classes (Q2249736) (← links)
- Excessive \([l, m]\)-factorizations (Q2352055) (← links)
- The excessive [3]-index of all graphs (Q2380288) (← links)
- The list-chromatic index of \(K_6\) (Q2436826) (← links)
- On the Complexity of Computing the Excessive [<i>B</i>]-Index of a Graph (Q2811195) (← links)
- (Q3089223) (← links)
- (Q3424771) (← links)
- On minimum sets of 1-factors covering a complete multipartite graph (Q3522849) (← links)
- (Q4430886) (← links)
- (Q5294945) (← links)
- 1-factorization of regular graphs by colour exchange (Q5460408) (← links)
- On fans in multigraphs (Q5469028) (← links)
- Group Testing with Pools of Fixed Size (Q6253114) (← links)