Triangle-factors in powers of graphs (Q3439011): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of every two-connected graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing 3-vertex paths in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the theorem by Fleischner / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s1571-0653(04)00513-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081507833 / rank
 
Normal rank

Latest revision as of 10:12, 30 July 2024

scientific article
Language Label Description Also known as
English
Triangle-factors in powers of graphs
scientific article

    Statements