Packing cycles through prescribed vertices under modularity constraints (Q444427): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.aam.2012.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989287241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the odd-minor variant of Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles through prescribed vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem / 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: Disjoint cycles intersecting a set of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the presence of disjoint subgraphs of a specified type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles with modularity constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:07, 5 July 2024

scientific article
Language Label Description Also known as
English
Packing cycles through prescribed vertices under modularity constraints
scientific article

    Statements

    Packing cycles through prescribed vertices under modularity constraints (English)
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    disjoint cycles
    0 references
    even cycles
    0 references
    feedback vertex sets
    0 references
    Erdős
    0 references
    Pósa property
    0 references

    Identifiers