Partition of a bipartite Hamiltonian graph into two cycles (Q1072572): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pancyclic graphs. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A method in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On circuits in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Hamiltonian bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arc coverings of graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:09, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partition of a bipartite Hamiltonian graph into two cycles |
scientific article |
Statements
Partition of a bipartite Hamiltonian graph into two cycles (English)
0 references
1986
0 references
The author proves that any bipartite graph with bipartition \((A,B)\), \(| A| =| B| =n\), such that for every \(u\in A\), \(v\in B\), \(\deg (u)+\deg (v)\geq n+2\), contains two independent cycles of lengths \(2n_1\) and \(2n_2\), whenever \(n_1,n_2\geq 2\) and \(n_1+n_2=n\).
0 references
bipartite graph
0 references
independent cycles
0 references