The problem of path decomposition for graphs with treewidth at most 4 (Q6494937): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai's path decomposition conjecture for graphs of small maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beautiful conjectures in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai's path decomposition conjecture for triangle-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Gallai's path decomposition conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai's path decomposition conjecture for graphs with treewidth at most 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of 6-regular bipartite graphs into paths of length six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai's conjecture for disconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / 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: Path decompositions and Gallai's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5539649 / 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 13:28, 3 December 2024

scientific article; zbMATH DE number 7840564
Language Label Description Also known as
English
The problem of path decomposition for graphs with treewidth at most 4
scientific article; zbMATH DE number 7840564

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references