Randomly orthogonal \((g,f)\)-factorizations in graphs
type: Item
instance of: scholarly article
title: Randomly orthogonal \((g,f)\)-factorizations in graphs
zbMATH Open document ID: 1010.05053
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2003-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1885792
zbMATH Keywords: \((g,f)\)-factorization
zbMATH Keywords: randomly \(k\)-orthogonal factorization
author: Guizhen Liu
author: He Ping Long
Wikidata QID: Q114228096
MaRDI profile type: Publication
full work available at URL: s102550200050
OpenAlex ID: W2041234071
cites work: An algorithmic proof of Tutte's f-factor theorem
cites work: Q3097395
cites work: A simple existence criterion for \((g<f)\)-factors
cites work: Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
cites work: [a,b]-factorization of a graph
cites work: \((g,f)\)-factorizations orthogonal to a subgraph of a graph
cites work: \((g,f)\)-factorization orthogonal to a star in graphs
cites work: Orthogonal \((g,f)\)-factorizations in graphs
cites work: Subgraphs with prescribed valencies
cites work: A characterization of graphs having all \((g,f)\)-factors
cites work: Q4332941
cites work: Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
DOI: 10.1007/S102550200050
description: scientific article; zbMATH DE number 1885792