Pages that link to "Item:Q5325949"
From MaRDI portal
The following pages link to An Upper Bound for the Excessive Index of an <i>r</i>‐Graph (Q5325949):
Displayed 7 items.
- Covering a cubic graph with perfect matchings (Q393450) (← links)
- On the excessive \([m]\)-index of a tree (Q741745) (← links)
- Berge-Fulkerson conjecture on certain snarks (Q2516508) (← links)
- On the Complexity of Computing the Excessive [<i>B</i>]-Index of a Graph (Q2811195) (← 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)
- Unions of perfect matchings in \(r\)-graphs (Q6172292) (← links)