On partitioning simple bipartite graphs in vertex-disjoint paths

zbMATH Open1150.05022MaRDI QIDQ925494FDOQ925494

Authors Mingxia Chen, Jianbo Li, Jianping Li, Lusheng Wang, Li Zhang 

Publication date 3 June 2008

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphsneighborhood unionsvertex-disjoint paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• Partitioning a bipartite graph into vertex-disjoint paths.
• The path partition problem and related problems in bipartite graphs
• Partitioning a graph into vertex-disjoint paths
• On the path partition of graphs
• On the bipartition of graphs
• Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
• On judicious bipartitions of graphs
• The path-partition problem in bipartite distance-hereditary graphs
• On path partitions of the divisor graph

Cited in

(6)

• A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph
• Partitioning a bipartite graph into vertex-disjoint paths.
• A note on internally disjoint alternating paths in bipartite graphs
• Partitioning a graph into vertex-disjoint paths
• On partitioning the edge set of a graph into internally disjoint paths without exterior vertices
• On the path partition of graphs

This page was built for publication: On partitioning simple bipartite graphs in vertex-disjoint paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925494)