Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The decomposition of trees into subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-packings of graphs and network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line edge-coloring with a fixed number of colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On grid intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-packing planar graphs by cyclic 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: Decompositions of multigraphs into parts with two edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Recognizing Equal Unions in Families of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitioning the edges of graphs into connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path factors in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative mobile guards in grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerant Guarding of Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge decompositions of multigraphs into 3-matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On gallery watchmen in grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of graphs and permutations -- a survey / rank
 
Normal rank

Latest revision as of 12:02, 27 June 2024

scientific article
Language Label Description Also known as
English
Packing \([1, \Delta ]\)-factors in graphs of small degree
scientific article

    Statements

    Packing \([1, \Delta ]\)-factors in graphs of small degree (English)
    0 references
    0 references
    0 references
    0 references
    14 November 2007
    0 references
    Packing factors
    0 references
    Edge-colorable subgraph
    0 references
    Fault tolerant guards
    0 references

    Identifiers