Binding number conditions for path-factor uniform graphs

DOI10.1007/S40840-025-01902-9MaRDI QIDQ6952170zbMATH OpenFDO

Authors Ping Zhang

Publication date 28 July 2025

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

zbMATH Keywords

\(k\)-connected graphbinding numberpath-factor uniform

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Binding number conditions for path-factor uniform graphs

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