Existence of subgraphs with orthogonal \((g,f)\)-factorization
type: Item
instance of: scholarly article
title: Existence of subgraphs with orthogonal \((g,f)\)-factorization
zbMATH Open document ID: 0903.05040
DOI: 10.1007/BF02900771
author: Jiaofeng Pan
author: Guiying Yan
published in: Science in China. Series A
publication date: 1999-01-05T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1180416
zbMATH Keywords: factorization
MaRDI profile type: Publication
cites work: Q4004080
cites work: Orthogonal \((g,f)\)-factorizations in graphs
cites work: Orthogonal \([k-1,k+1]\)-factorizations in graphs
Recommended article: Q4653414
Recommended article: The existence of subdigraphs with orthogonal factorizations in digraphs
Recommended article: Subgraphs with Orthogonal $$[0,k_{i}]_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs
Recommended article: \((g,f)\)-factorizations orthogonal to a subgraph of a graph
Recommended article: \((g,f)\)-factorizations of graphs orthogonal to \([1,2]\)-subgraphs
Recommended article: Q4806262
Recommended article: Subgraphs with orthogonal factorizations in graphs
Recommended article: Q4448753
Recommended article: On \((n,k)\)-orthogonal factorizations in subgraphs of graphs
Recommended article: Q4927865
description: scientific article; zbMATH DE number 1180416