Proper connection of graphs (Q442366): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2011.09.003 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6064670 / rank
 
Normal rank
Property / zbMATH Keywords
 
proper coloring
Property / zbMATH Keywords: proper coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
proper connection
Property / zbMATH Keywords: proper connection / 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.disc.2011.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083641445 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2011.09.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:46, 9 December 2024

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

    Statements

    Identifiers