Vertex-disjoint 4-cycles containing specified edges in a bipartite graph (Q2566145): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q2712508 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the maximal number of independent triangles in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex-disjoint cycles containing specified edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the maximum number of independent cycles in a bipartite graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proof of a conjecture on cycles in a bipartite graph / rank | |||
Normal rank | |||
Latest revision as of 15:36, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex-disjoint 4-cycles containing specified edges in a bipartite graph |
scientific article |
Statements
Vertex-disjoint 4-cycles containing specified edges in a bipartite graph (English)
0 references
22 September 2005
0 references
Short cycle
0 references
Packing
0 references
