On a cycle through a specified linear forest of a graph (Q868359): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Menger's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through subsets with large degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits through specified edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On paths and cycles through specified vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles through a linear forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuits containing specified edges / rank
 
Normal rank

Latest revision as of 14:24, 25 June 2024

scientific article
Language Label Description Also known as
English
On a cycle through a specified linear forest of a graph
scientific article

    Statements

    Identifiers