Graphs containing every 2-factor (Q1926028): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q312270
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexandr V. Kostochka / 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.1007/s00373-011-1066-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006747488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Arbitrary Graphs of Maximum Degree Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings of graphs and applications to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs of graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of disjoint cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian square-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type versions of Brooks' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type graph packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type analogue of the Sauer-Spencer theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type conditions implying 2-factors consisting of short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of independent cycles in a graph / rank
 
Normal rank

Latest revision as of 01:08, 6 July 2024

scientific article
Language Label Description Also known as
English
Graphs containing every 2-factor
scientific article

    Statements

    Identifiers