Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6555283
scientific article; zbMATH DE number 6639354
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1346.05147 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/j.endm.2015.06.011 / rank
 
Normal rank
Property / published in
 
Property / published in: Electronic Notes in Discrete Mathematics / rank
 
Normal rank
Property / publication date
 
14 October 2016
Timestamp+2016-10-14T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 14 October 2016 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C42 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6639354 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1532129519 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2558999877 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.00494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Graphs of High Degree are 1-Factorizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the $1$-factorization and Hamilton Decomposition Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gallai's conjecture for disconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and spanning-tree packing in random graphs with an application to load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of Vizing's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal covers with Hamilton cycles in random 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: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint Hamilton cycles in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Random Graphs into Few Cycles and Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Packings of Hamilton Cycles in Sparse Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular expanders: applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian degree sequences in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5539649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear arboricity of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to find overfull subgraphs in graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overfull conjecture for graphs with high minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325729 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:25, 12 July 2024

scientific article; zbMATH DE number 6639354
Language Label Description Also known as
English
Optimal path and cycle decompositions of dense quasirandom graphs
scientific article; zbMATH DE number 6639354

    Statements

    Optimal path and cycle decompositions of dense quasirandom graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2016
    0 references
    14 October 2016
    0 references
    path decomposition
    0 references
    cycle decomposition
    0 references
    linear arboricity
    0 references
    overfull subgraph conjecture
    0 references
    robust expander
    0 references
    quasirandom graph
    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
    0 references