Minimum degree condition for proper connection number 2 (Q2424876): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2829346 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proper connection of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rainbow connection in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proper connection number of random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proper connection numbers of complementary graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proper connection number and connected dominating sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rainbow connections of graphs: a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Panconnected graphs. II / rank | |||
Normal rank |
Latest revision as of 16:16, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum degree condition for proper connection number 2 |
scientific article |
Statements
Minimum degree condition for proper connection number 2 (English)
0 references
25 June 2019
0 references
proper connection number
0 references
proper-path coloring
0 references
bridge-block tree
0 references
minimum degree
0 references