On Enomoto's problems in a bipartite graph

DOI10.1007/S11425-009-0012-ZzbMATH Open1229.05188OpenAlexW1963586963MaRDI QIDQ1044262FDOQ1044262

Authors: Jin Yan, Yunshu Gao 

Publication date: 11 December 2009

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-009-0012-z

Recommendations

• scientific article; zbMATH DE number 4103103
• On problems about judicious bipartitions of graphs
• scientific article; zbMATH DE number 4202309
• scientific article; zbMATH DE number 4053666
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• On the bipartition of graphs
• An extremal problem for paths in bipartite graphs
• scientific article; zbMATH DE number 1347011
• scientific article; zbMATH DE number 3924817
• On the deficiency of bipartite graphs

zbMATH Keywords

independent cycles in a bipartite graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• On the maximal number of independent circuits in a graph
• On the maximum number of independent cycles in a bipartite graph
• On 2-factors with prescribed properties in a bipartite graph
• Proof of a conjecture on cycles in a bipartite graph
• Disjoint triangles and quadrilaterals in a graph
• On 2-factors of a bipartite graph
• Graph partition problems into cycles and paths
• Large vertex-disjoint cycles in a bipartite graph
• Title not available (Why is that?)

Cited In (2)

• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• The confirmation of a conjecture on disjoint cycles in a graph

This page was built for publication: On Enomoto's problems in a bipartite graph

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