Characterizations of graphs having large proper connection numbers (Q274703): 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: 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 |
Revision as of 20: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
25 April 2016
0 references
edge coloring
0 references
proper-path coloring
0 references
strong proper-path coloring
0 references