A generalization of orthogonal factorizations in digraphs
type: Item
instance of: scholarly article
title: A generalization of orthogonal factorizations in digraphs
zbMATH Open document ID: 1429.05171
published in: Information Processing Letters
publication date: 2018-03-16T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 6850979
zbMATH Keywords: combinatorial problems
zbMATH Keywords: digraph
zbMATH Keywords: subdigraph
zbMATH Keywords: \((g,f)\)-factor
zbMATH Keywords: \(k\)-orthogonal factorization
author: Zhiren Sun
author: Sizhong Zhou
MaRDI profile type: Publication
full work available at URL: j.ipl.2017.12.003
OpenAlex ID: W2779427255
cites work: Q4004080
cites work: Q4448753
cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
cites work: Room designs and one-factorizations
cites work: Orthogonal (g, f)-factorizations in networks
cites work: Orthogonal factorizations of graphs
cites work: Orthogonal factorizations of digraphs
cites work: Randomly orthogonal \((g,f)\)-factorizations in graphs
cites work: The 1-Factors of Oriented Graphs
cites work: Subdigraphs with orthogonal factorizations of digraphs
cites work: Remarks on orthogonal factorizations of digraphs
cites work: Subdigraphs with orthogonal factorizations of digraphs. II
Wikidata QID: Q114167111
DOI: 10.1016/J.IPL.2017.12.003
description: scientific article; zbMATH DE number 6850979