Combinatorial and computational aspects of graph packing and graph decomposition (Q458446): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cosrev.2007.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W130689240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the decomposition of graphs into isomorphic matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2761012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Functions for <i>H</i>-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized planar matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3K2-decomposition of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packings of \(K_4\)'s into a \(K_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing triangles in bounded degree graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of large combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing graphs: The packing problem solved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition of slim graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / 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: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect packings with complete graphs minus an edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuits in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of a factor of degree one of a connected random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near perfect coverings in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every monotone graph property has a sharp threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for constructing Szemerédi's regularity partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of tower type for Szemerédi's uniformity lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-perfect hypergraph packing is in NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fractional <i>K</i>‐factors of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packings in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded \(H\)-matching is Max SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in random uniform hypergraphs / 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: An Optimal Algorithm for Checking Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling Turán theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic version of the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle Factors in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical chromatic number and the complexity of perfect packings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3891767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / 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: Q4201584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packings of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and covering the vertices of a random graph by copies of a given graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a tiling conjecture of Komlós / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2000000 Steiner Triple Systems of Order 19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Erdős-Faudree conjecture on quadrilaterals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and decomposition of graphs with trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decomposition threshold for bipartite graphs with minimum degree one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of Trees Decompose the Random Graph in an Arbitrary Way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packing of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional decompositions of dense hypergraphs / rank
 
Normal rank

Latest revision as of 02:37, 9 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial and computational aspects of graph packing and graph decomposition
scientific article

    Statements

    Combinatorial and computational aspects of graph packing and graph decomposition (English)
    0 references
    0 references
    7 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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