Path-systems in regular graphs and bipartite graphs

DOI10.61091/UM123-09MaRDI QIDQ6920976zbMATH OpenFDO

Authors Mikio Kano, Haruhide Matsuda, Hajime Matsumura

Publication date 6 October 2025

Published in Utilitas Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/UM123-09

zbMATH Keywords

bipartite graphpath-systemregular graphvertex-disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites work

• Characterization of 1-tough graphs using factors
• DisjointT-paths in tough graphs
• Factors and factorizations of graphs. Proof techniques in factor theory
• Factors with red-blue coloring of claw-free graphs and cubic graphs
• Graphs with 1-Factors
• Remarks on regular factors of regular graphs
• The factorization of graphs. II
• Über die Zerlegung regulärer Streckenkomplexe ungerader Ordnung.

This page was built for publication: Path-systems in regular graphs and bipartite graphs

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