Ore-type conditions implying 2-factors consisting of short cycles (Q1044946): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989024161 / 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: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer / 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: 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 07:51, 2 July 2024

scientific article
Language Label Description Also known as
English
Ore-type conditions implying 2-factors consisting of short cycles
scientific article

    Statements

    Identifiers