Characterizations of graphs having large proper connection numbers (Q274703): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ping Zhang / rank
Normal rank
 
Property / author
 
Property / author: Ping Zhang / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C75 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6572940 / rank
 
Normal rank
Property / zbMATH Keywords
 
edge coloring
Property / zbMATH Keywords: edge coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
proper-path coloring
Property / zbMATH Keywords: proper-path coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
strong proper-path coloring
Property / zbMATH Keywords: strong proper-path coloring / 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.7151/dmgt.1867 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2323097292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2829346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3065457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterize graphs with rainbow connection number $m-2$ and $m-3$ / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:08, 11 July 2024

scientific article
Language Label Description Also known as
English
Characterizations of graphs having large proper connection numbers
scientific article

    Statements

    Characterizations of graphs having large proper connection numbers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    edge coloring
    0 references
    proper-path coloring
    0 references
    strong proper-path coloring
    0 references
    0 references