A note on disjoint cycles (Q413261): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2011.11.006 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088478548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for cycle packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of packing disjoint cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342984 / 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: On the existence of disjoint cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of the maximum genus of a signed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization in of Upper-Embeddable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4277394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kuratowski-type theorem for the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284654 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2011.11.006 / rank
 
Normal rank

Latest revision as of 16:49, 9 December 2024

scientific article
Language Label Description Also known as
English
A note on disjoint cycles
scientific article

    Statements

    Identifiers