Path factors of bipartite graphs

DOI10.1002/JGT.3190180207MaRDI QIDQ4284102zbMATH OpenOpenAlexFDO

Authors Hong Wang

Publication date 1994

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190180207

zbMATH Keywords

bipartite graphpath factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 3893247
• The existence of a path-factor without small odd paths
• \(P_{5}\)-factorization of complete bipartite graphs
• \(P_ 3\)-factorization of complete bipartite graphs
• \(P_{2p}\)-factorization of a complete bipartite graph

Cites work

• A matching problem with side conditions
• Factors and factorizations of graphs—a survey
• On factors with given components
• The Factorization of Linear Graphs
• The Factors of Graphs

Cited in

(22)

• On path factors of \((3,4)\)-biregular bigraphs
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• The existence of a path-factor without small odd paths
• Packing paths of length at least two
• The existence of path-factor covered graphs
• On path-factor critical deleted (or covered) graphs
• Degree sum conditions for path-factors with specified end vertices in bipartite graphs
• The spectrum of path factorization of bipartite multigraphs
• The path partition problem and related problems in bipartite graphs
• \(P_3\)-factors in the square of a tree
• Remarks on path factors in graphs
• Path and cycle factors of cubic bipartite graphs
• scientific article; zbMATH DE number 3893247 (Why is no real title available?)
• Path-factors involving paths of order seven and nine
• The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices
• Path-factor critical covered graphs and path-factor uniform graphs
• Path factors in bipartite graphs from size or spectral radius
• Independence number and minimum degree for path-factor critical uniform graphs
• Degree sum conditions for path-factor uniform graphs
• Tight toughness, isolated toughness and binding number bounds for \(( \mathscr{A},n) \)-critical deleted graphs
• Path-factors in the square of a tree
• Path factors and parallel knock-out schemes of almost claw-free graphs

This page was built for publication: Path factors of bipartite graphs

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