Packing paths of length at least two
type: Item
instance of: scholarly article
title: Packing paths of length at least two
zbMATH Open document ID: 1042.05084
author: Gyula Y. Katona
author: Mikio Kano
author: Zoltán Király
published in: Discrete Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 2083725
zbMATH Keywords: Path factor
zbMATH Keywords: Graph factor
zbMATH Keywords: Packing
MaRDI profile type: Publication
full work available at URL: j.disc.2004.01.016
OpenAlex ID: W1963596676
cites work: Factors and factorizations of graphs—a survey
cites work: Q4263715
cites work: The k‐piece packing problem
cites work: On the completeness of a generalized matching problem
cites work: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
cites work: Q3972010
cites work: Subgraphs with prescribed valencies
cites work: Matching theory
cites work: Some Generalizations of the Problem of Distinct Representatives
cites work: The Factors of Graphs
cites work: Path factors of bipartite graphs
DOI: 10.1016/J.DISC.2004.01.016
description: scientific article; zbMATH DE number 2083725