On the minimum degree and the proper connection number of graphs (Q510954): 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.1016/j.endm.2016.10.028 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2556031989 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proper connection 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 10:58, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the minimum degree and the proper connection number of graphs |
scientific article |
Statements
On the minimum degree and the proper connection number of graphs (English)
0 references
14 February 2017
0 references
proper connection number
0 references
2-connected
0 references
minimum degree
0 references