Subgraphs with orthogonal factorizations in graphs
DOI10.1016/J.DAM.2019.12.011zbMATH Open1448.05166OpenAlexW2999554972WikidataQ114191508 ScholiaQ114191508MaRDI QIDQ2201767FDOQ2201767
Authors: Tao Zhang, Zurun Xu, Sizhong Zhou 
Publication date: 17 September 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.12.011
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of orthogonal factorizations in digraphs
- A sufficient condition for a graph to be an (a, b, k)-critical graph
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- A toughness condition for fractional \((k,m)\)-deleted graphs
- Decomposition of graphs into \((g,f)\)-factors
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Orthogonal (g, f)-factorizations in networks
- Orthogonal \((g,f)\)-factorizations in graphs
- Orthogonal factorizations in networks
- Orthogonal factorizations of graphs
- Randomly orthogonal \((g,f)\)-factorizations in graphs
- Remarks on orthogonal factorizations of digraphs
- Remarks on path factors in graphs
- Some new sufficient conditions for graphs to have fractional \(k\)-factors
- Some problems on factorizations with constraints in bipartite graphs
- Some results about component factors in graphs
- Subdigraphs with orthogonal factorizations of digraphs. II
- Subgraphs with orthogonal factorizations and algorithms
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- [a,b]‐factorizations of graphs
- [a,b]-factorization of a graph
Cited In (25)
- A result on fractional \((a,b,k)\)-critical covered graphs
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
- Subgraphs with orthogonal \([0,k_{i}]_{1}^{n}\)-factorizations in graphs
- On \(P_{\geq 3}\)-factor deleted graphs
- An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
- The existence of subdigraphs with orthogonal factorizations in digraphs
- Discussions on orthogonal factorizations in digraphs
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
- Component factors and binding number conditions in graphs
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
- Some results on path-factor critical avoidable graphs
- Toughness for fractional \((2, b, k)\)-critical covered graphs
- Research on fractional critical covered graphs
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
- Existence of subgraphs with orthogonal \((g,f)\)-factorization
- A neighborhood condition for graphs to have restricted fractional (g,f)-factors
- Title not available (Why is that?)
- Orthogonal factorizations in networks
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- Randomly \(r\)-orthogonal factorizations in bipartite graphs
- Orthogonal factorizations of graphs
- On \(k\)-orthogonal factorizations in networks
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- Path factors in subgraphs
This page was built for publication: Subgraphs with orthogonal factorizations in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201767)
