Increasing the Minimum Degree of a Graph by Contractions (Q2891338): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / OpenAlex ID
 
Property / OpenAlex ID: W1913947078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding small degree-constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-contraction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Contractions in Subclasses of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction and Treewidth Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting chordal graphs and bipartite graphs to paths and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph contractions and induced minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs into connected parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractions of Planar Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of graph contractions II: Two tough polynomially solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the removal of forbidden graphs by edge-deletion or by edge- contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-hardness of edge-deletion and -contraction problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:02, 5 July 2024

scientific article
Language Label Description Also known as
English
Increasing the Minimum Degree of a Graph by Contractions
scientific article

    Statements

    Increasing the Minimum Degree of a Graph by Contractions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 June 2012
    0 references

    Identifiers