On the minimum degree and the proper connection number of graphs (Q510954): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C07 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6684452 / rank
 
Normal rank
Property / zbMATH Keywords
 
proper connection number
Property / zbMATH Keywords: proper connection number / rank
 
Normal rank
Property / zbMATH Keywords
 
2-connected
Property / zbMATH Keywords: 2-connected / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum degree
Property / zbMATH Keywords: minimum degree / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 09: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
    0 references
    0 references
    0 references
    14 February 2017
    0 references
    proper connection number
    0 references
    2-connected
    0 references
    minimum degree
    0 references

    Identifiers