Minimum degree and pan-\(k\)-linked graphs (Q1025918): 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.2008.07.038 / rank | |||
Property / cites work | |||
Property / cites work: A sufficient condition for all short cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Panconnected graphs. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weakly pancyclic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3158579 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved linear edge bound for graph linkages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4949827 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: K-linked graphs with girth condition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Sufficient Degree Conditions for a Graph to be $k$-linked / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3428647 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path extendable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subdivision extendibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path connected graphs / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2008.07.038 / rank | |||
Normal rank |
Latest revision as of 13:33, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum degree and pan-\(k\)-linked graphs |
scientific article |
Statements
Minimum degree and pan-\(k\)-linked graphs (English)
0 references
23 June 2009
0 references
path system
0 references
extendability
0 references
minimum degree
0 references
\(k\)-linked
0 references
panconnected
0 references