\(P_{2p}\)-factorization of a complete bipartite graph
type: Item
instance of: scholarly article
title: \(P_{2p}\)-factorization of a complete bipartite graph
zbMATH Open document ID: 0781.05040
DOI: 10.1016/0012-365X(93)90593-I
author: Hong Wang
published in: Discrete Mathematics
publication date: 1993-12-15T00:00:00Z
review text: Given a graph \(G\), every spanning subgraph with all its components isomorphic to the \(2k\)-vertex path is called a \(P_{2k}\)-factor of \(G\), for a fixed integer \(k\geq 1\). It is shown that the complete bipartite graph \(K_{n,m}\) is the edge-disjoint union of \(P_{2k}\)-factors if and only if \(m=n\) and \(m\equiv 0\mod{k(2k-1)}\).
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 429163
zbMATH Keywords: factorization
zbMATH Keywords: factor
zbMATH Keywords: complete bipartite graph
reviewed by: Erich Prisner
MaRDI profile type: Publication
cites work: Q5422499
full work available at URL: 0012-365x(93)90593-i
OpenAlex ID: W2007355125
Wikidata QID: Q127359269
description: scientific article; zbMATH DE number 429163