Decomposition of graphs into \((g,f)\)-factors

DOI10.1007/S003730050009zbMath0942.05058OpenAlexW1979865185MaRDI QIDQ1972327

Yanyan Li

Publication date: 21 August 2000

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730050009

zbMATH Keywords

multigraphdecompositionfactorization\((g,f)\)-factor

Mathematics Subject Classification ID

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

Related Items (4)

Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Subgraphs with orthogonal factorizations in graphs

This page was built for publication: Decomposition of graphs into \((g,f)\)-factors