Path decompositions and Gallai's conjecture (Q1767666): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Geng-Hua Fan / rank
Normal rank
 
Property / author
 
Property / author: Geng-Hua Fan / 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.jctb.2004.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965187305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai's conjecture for disconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the path number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph coverings and edge switchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5539649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the edges of a connected graph by paths / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:37, 7 June 2024

scientific article
Language Label Description Also known as
English
Path decompositions and Gallai's conjecture
scientific article

    Statements

    Path decompositions and Gallai's conjecture (English)
    0 references
    8 March 2005
    0 references
    0 references
    Path
    0 references
    Decomposition
    0 references
    Gallai's conjecture
    0 references
    0 references
    0 references