Minimum degree conditions for the proper connection number of graphs (Q2409521): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-017-1796-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2618308016 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2829346 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proper connection of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the minimum degree and the proper connection number of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5572939 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Long cycles in bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of Hamiltonian prisms / rank | |||
Normal rank | |||
Latest revision as of 12:43, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum degree conditions for the proper connection number of graphs |
scientific article |
Statements
Minimum degree conditions for the proper connection number of graphs (English)
0 references
11 October 2017
0 references
proper connection number
0 references
2-connected graphs
0 references
minimum degree
0 references
