scientific article; zbMATH DE number 1792587

zbMATH Open0994.05086MaRDI QIDQ4552170FDOQ4552170

Authors: G. Gutin 

Publication date: 29 August 2002

Title of this publication is not available (Why is that?)

Recommendations

• On connencted \([g,f+1]\)-factors in graphs
• Connected \((g,f)\)-factors
• Orthogonal factorizations of digraphs
• Connected factors in graphs -- a survey
• Binding number and Hamiltonian (g, f)-factors in graphs II

zbMATH Keywords

digraphHamiltonianfactorsupereulerian

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (9)

• Subeulerian oriented graphs
• Symmetric core and spanning trails in directed networks
• Matching and spanning trails in digraphs
• Supereulerian digraphs with given diameter
• Sufficient conditions for a digraph to be supereulerian
• Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs
• Degree condition for a digraph to be supereulerian
• Locally dense supereulerian digraphs
• Supereulerian digraphs with large arc-strong connectivity

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 Q4552170)