The following pages link to Zan-Bo Zhang (Q534041):
Displaying 29 items.
- M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities (Q534043) (← links)
- Construction characterizations for defect \(n\)-extendable bipartite graphs (Q624140) (← links)
- M-alternating Hamilton paths and \(M\)-alternating Hamilton cycles (Q1025964) (← links)
- Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs (Q1926044) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs (Q2124619) (← links)
- \(k\)-ary spanning trees contained in tournaments (Q2197413) (← links)
- The cubic graphs with finite cyclic vertex connectivity larger than girth (Q2214044) (← links)
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
- Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652) (← links)
- Triangle strings: structures for augmentation of vertex-disjoint triangle sets (Q2448121) (← links)
- (Q2816508) (← links)
- Equivalence between Extendibility and Factor-Criticality (Q3070213) (← links)
- Notes on factor-criticality, extendibility and independence number (Q3070279) (← links)
- (Q3114982) (← links)
- Bipartite graphs with a perfect matching and digraphs (Q3392504) (← links)
- A polynomial time algorithm for cyclic vertex connectivity of cubic graphs (Q4976338) (← links)
- Some degree conditions for 𝒫<sub>≥<i>k</i></sub>-factor covered graphs (Q5034714) (← links)
- Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths (Q5088514) (← links)
- Sufficient conditions for graphs with {<i>P</i><sub>2</sub>, <i>P</i><sub>5</sub>}-factors (Q5104638) (← links)
- Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs (Q5300495) (← links)
- (Q5318998) (← links)
- Extremal and Degree Conditions for Path Extendability in Digraphs (Q5357959) (← links)
- Remarks on component factors in <i>K</i><sub>1,<i>r</i></sub>-free graphs (Q6045046) (← links)
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments (Q6055389) (← links)
- A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)
- Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs (Q6495263) (← links)
- Convergence and correctness of belief propagation for weighted min-max flow (Q6558678) (← links)
- Length of cycles in generalized Petersen graphs (Q6621270) (← links)
