Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs (Q1297492): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Representatives of Subsets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on Hamilton Circuits / rank | |||
Normal rank | |||
Latest revision as of 20:33, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs |
scientific article |
Statements
Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs (English)
0 references
26 April 2000
0 references
Sufficient conditions for a graph to have a 2-connected \([2,3]\)-factor are given. Moreover, graphs with 2-edge-connected \([2,k]\)-factors are studied.
0 references
\([2,k]\)-factor
0 references
connected factor
0 references
degree
0 references
