Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximum \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in extensions of 2\(K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum regular induced subgraphs in \(2P_3\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inapproximability of independent domination in \(2P_3\)-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satgraphs and independent domination. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large \(2P_ 3\)-free graphs with bounded degree / rank
 
Normal rank

Latest revision as of 23:11, 16 July 2024

scientific article
Language Label Description Also known as
English
Sparse regular induced subgraphs in \(2P_3\)-free graphs
scientific article

    Statements

    Sparse regular induced subgraphs in \(2P_3\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2018
    0 references
    regular graph
    0 references
    induced subgraph
    0 references
    polynomial-time algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references