Pages that link to "Item:Q1402062"
From MaRDI portal
The following pages link to \(M\)-alternating paths in \(n\)-extendable bipartite graphs (Q1402062):
Displaying 11 items.
- M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities (Q534043) (← links)
- Graphs with no \(M\)-alternating paths between two vertices: an update (Q712278) (← links)
- M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles (Q1025964) (← links)
- A note on internally disjoint alternating paths in bipartite graphs (Q1764910) (← links)
- Graphs with no \(M\)-alternating path between two vertices (Q1827684) (← links)
- Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (Q1886352) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Characterizing minimally \(n\)-extendable bipartite graphs (Q2483409) (← links)
- Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs (Q2519822) (← links)
- Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains (Q5747711) (← links)
- Edge proximity conditions for extendability in regular bipartite graphs (Q6094028) (← links)
