Pages that link to "Item:Q4265583"
From MaRDI portal
The following pages link to Indecomposabler-graphs and some other counterexamples (Q4265583):
Displaying 8 items.
- Hamilton cycles in 5-connected line graphs (Q412285) (← links)
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows (Q1612758) (← links)
- An Upper Bound for the Excessive Index of an <i>r</i>‐Graph (Q5325949) (← links)
- Highly edge‐connected regular graphs without large factorizable subgraphs (Q6056797) (← links)
- On the existence of graphs which can colour every regular graph (Q6162043) (← links)
- Pairwise Disjoint Perfect Matchings in <i>r</i>-Edge-Connected <i>r</i>-Regular Graphs (Q6170446) (← links)
- Edge-connectivity and pairwise disjoint perfect matchings in regular graphs (Q6548022) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)