Vertex-disjoint hexagons with chords in a bipartite graph
From MaRDI portal
Publication:1584300
Recommendations
- Vertex-disjoint double chorded cycles in bipartite graphs
- On vertex-disjoint complete bipartite subgraphs in a bipartite graph
- Vertex-disjoint cycles of order eight with chords in a bipartite graph
- Proof of a conjecture on cycles in a bipartite graph
- Large vertex-disjoint cycles in a bipartite graph
Cites work
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- 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
Cited in
(10)- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Tiling tripartite graphs with 3-colorable graphs: the extreme case
- On vertex-disjoint complete bipartite subgraphs in a bipartite graph
- Results and problems on chorded cycles: a survey
- The edge condition for independent cycles with chords in bipartite graphs
- Ore-type conditions for bipartite graphs containing hexagons
- Vertex-disjoint double chorded cycles in bipartite graphs
- A note on a spectral condition for the existence of K₁ P₄
- Extremal function of two independent chorded cycles in a bipartite graph
- Signless Laplacian index conditions for trebly chorded cycles in graphs with given order
This page was built for publication: Vertex-disjoint hexagons with chords in a bipartite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584300)
