The edge condition for independent cycles with chords in bipartite graphs
From MaRDI portal
Publication:2177869
DOI10.1016/j.amc.2020.125163zbMath1462.05296OpenAlexW3009819349MaRDI QIDQ2177869
Publication date: 7 May 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125163
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The extremal function for two disjoint cycles
- Disjoint chorded cycles in graphs
- Vertex-disjoint hexagons with chords in a bipartite graph
- Decompositions of graphs into cycles with chords
- On vertex-disjoint complete bipartite subgraphs in a bipartite graph
- On independent cycles and edges in graphs
- On the maximum number of independent cycles in a bipartite graph
- Vertex-disjoint double chorded cycles in bipartite graphs
- On the maximal number of independent circuits in a graph
- On independent cycles in a bipartite graph
This page was built for publication: The edge condition for independent cycles with chords in bipartite graphs