scientific article; zbMATH DE number 2044929

MaRDI QIDQ4448753zbMATH OpenFDO

Authors Haodi Feng

Publication date 18 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2204/22040129.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• \((g,f)\)-factorizations orthogonal to a subgraph of a graph
• scientific article; zbMATH DE number 2141143
• \((g,f)\)-factorizations of graphs orthogonal to \([1,2]\)-subgraphs
• On (n,k)-orthogonal factorizations in subgraphs of graphs
• Subgraphs with orthogonal \([0,k_{i}]_{1}^{n}\)-factorizations in graphs
• \([0,k_i]_1^m\)-factorizations orthogonal to a subgraph
• Orthogonal \((g,f)\)-factorizations in graphs
• Orthogonal \([k-1,k+1]\)-factorizations in graphs
• Orthogonal \([0,k_i]_1^m\)-factorizations of graphs
• A \((g,f)\)-factorization 2-orthogonal to a few types of subgraphs

Cited in

(13)

• Existence of subgraphs with orthogonal \((g,f)\)-factorization
• Randomly orthogonal factorizations with constraints in bipartite networks
• A generalization of orthogonal factorizations in digraphs
• A result on r-orthogonal factorizations in digraphs
• Randomly orthogonal factorizations in networks
• A \((g,f)\)-factorization 2-orthogonal to a few types of subgraphs
• scientific article; zbMATH DE number 1375381 (Why is no real title available?)
• scientific article; zbMATH DE number 2016590 (Why is no real title available?)
• Orthogonal (g, f)-factorizations in networks
• scientific article; zbMATH DE number 6178037 (Why is no real title available?)
• Orthogonal \((g,f)\)-factorizations of bipartite graphs
• Existence of a trade-off factorization of a partially \(4\)-homogeneous graph
• Subgraphs with orthogonal factorizations and algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448753)