The edge condition for independent cycles with chords in bipartite graphs
From MaRDI portal
(Redirected from Publication:2177869)
Recommendations
Cites work
- Decompositions of graphs into cycles with chords
- Disjoint chorded cycles in graphs
- Graph theory
- scientific article; zbMATH DE number 4101249 (Why is no real title available?)
- On independent cycles and edges in graphs
- On independent cycles in a bipartite graph
- On the maximal number of independent circuits in a graph
- On the maximum number of independent cycles in a bipartite graph
- On vertex-disjoint complete bipartite subgraphs in a bipartite graph
- The extremal function for two disjoint cycles
- Vertex-disjoint double chorded cycles in bipartite graphs
- Vertex-disjoint hexagons with chords in a bipartite graph
Cited in
(7)- Chorded pancyclicity in \(k\)-partite graphs
- Results and problems on chorded cycles: a survey
- scientific article; zbMATH DE number 4106890 (Why is no real title available?)
- Extremal function of two independent chorded cycles in a bipartite graph
- The bipartite Turán number of independent cycles with different lengths
- A general theorem in spectral extremal graph theory
- Spectral radius of bipartite graphs with chorded cycles
This page was built for publication: The edge condition for independent cycles with chords in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177869)