Subgraphs with Orthogonal $$[0,k_{i}]_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs

DOI10.1007/978-3-319-53007-9_32zbMath1487.05214OpenAlexW2583793374MaRDI QIDQ2971666

Tao Zhang, Zurun Xu, Si-zhong Zhou

Publication date: 7 April 2017

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_32

zbMATH Keywords

factorsubgraphorthogonal\([0, k_i_1^{m}\)-factorization]

Mathematics Subject Classification ID

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

Related Items (1)

Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors]

Cites Work

• Unnamed Item
• Unnamed Item
• Subdigraphs with orthogonal factorizations of digraphs
• Subgraphs with orthogonal factorizations and algorithms
• Some problems on factorizations with constraints in bipartite graphs
• Randomly orthogonal \((g,f)\)-factorizations in graphs
• Orthogonal \((g,f)\)-factorizations in graphs
• Subdigraphs with orthogonal factorizations of digraphs. II
• Orthogonal (g, f)-factorizations in networks
• Orthogonal factorizations in networks
• Orthogonal factorizations of graphs

This page was built for publication: Subgraphs with Orthogonal $$[0,k_{i}]_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs