Proper connection of graphs (Q442366): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cycles and paths in edge‐colored graphs with given degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles and paths in edge-coloured multigraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative length of long paths and cycles in graphs with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly colored paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relative length of longest paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Hamiltonian prisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimally rainbow \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color degree and alternating cycles in edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnected graphs. II / rank
 
Normal rank

Latest revision as of 12:46, 5 July 2024

scientific article
Language Label Description Also known as
English
Proper connection of graphs
scientific article

    Statements

    Identifiers