Gallai's Conjecture For Graphs of Girth at Least Four (Q5417821): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123336338, #quickstatements; #temporary_batch_1710346988437 |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1002/jgt.21735 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/jgt.21735 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1866996682 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path decompositions of multigraphs / 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: Path decompositions and Gallai's conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering the edges of a connected graph by paths / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/JGT.21735 / rank | |||
Normal rank |
Latest revision as of 16:57, 30 December 2024
scientific article; zbMATH DE number 6297903
Language | Label | Description | Also known as |
---|---|---|---|
English | Gallai's Conjecture For Graphs of Girth at Least Four |
scientific article; zbMATH DE number 6297903 |
Statements
Gallai's Conjecture For Graphs of Girth at Least Four (English)
0 references
22 May 2014
0 references
girth
0 references
path-decomposition
0 references