A new degree condition for graphs to have \([a,b]\)-factor (Q1764908): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2004.09.010 / rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On k-factor-critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4376498 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2767287 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4949854 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subgraphs with prescribed valencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the structure of factorizable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A neighbourhood condition for graphs to have \([a,b]\)-factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A degree condition for the existence of regular factors inK1,n-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On n-extendable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5287862 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2004.09.010 / rank | |||
Normal rank |
Latest revision as of 09:32, 11 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new degree condition for graphs to have \([a,b]\)-factor |
scientific article |
Statements
A new degree condition for graphs to have \([a,b]\)-factor (English)
0 references
22 February 2005
0 references
factor
0 references
\([a,b]\)-factor
0 references
\((a,b,n)\)-critical graph
0 references