Three ways to cover a graph (Q898135): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2015.10.023 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1205.1627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilayer grid embeddings for VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and packing in graphs IV: Linear arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The star arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear arboricity and linear \(k\)-arboricity of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding small triangulations of convex 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems in multiple-interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decomposition of graphs into complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph treewidth and geometric thickness parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two dual classes of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covers of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite dimensions and bipartite degrees of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Caterpillar arboricity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On star and caterpillar arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and packing in graphs. V. Mispacking subcubes in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Values of the Interval Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on linear arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COVERING AND PACKING IN GRAPHS, I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On double and multiple interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-intersection graphs of grid paths: the bend-number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bend-number of planar and outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Clique Covering of Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing d-Interval Graphs and d-Track Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5539649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered Ramsey theory and track representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The thickness of graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclique covers and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interval number of a planar graph: Three intervals suffice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphs with fixed interval number is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge intersection graphs of linear 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the degree bound for interval number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruent Graphs and the Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of planar graphs of maximum degree seven is four / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2015.10.023 / rank
 
Normal rank

Latest revision as of 07:40, 10 December 2024

scientific article
Language Label Description Also known as
English
Three ways to cover a graph
scientific article

    Statements

    Three ways to cover a graph (English)
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    graph covering
    0 references
    interval number
    0 references
    track number
    0 references
    linear arboricity
    0 references
    caterpillar arboricity
    0 references
    star arboricity
    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