König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5263777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the minimum 3-path vertex cover and dissociation number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial and computational aspects of graph packing and graph decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chain packing in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: König graphs for 3-paths and 3-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the graphs in which the transversal number equals the matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On König graphs with respect to P4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank

Latest revision as of 03:43, 21 July 2024

scientific article; zbMATH DE number 7139178
Language Label Description Also known as
English
König Graphs with Respect to the 4-Path and Its Spanning Supergraphs
scientific article; zbMATH DE number 7139178

    Statements

    König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (English)
    0 references
    2 December 2019
    0 references
    subgraph packing
    0 references
    vertex cover of a subgraph
    0 references
    4-path
    0 references
    König graph
    0 references
    0 references
    0 references

    Identifiers