Decomposition of bounded degree graphs into \(C_4\)-free subgraphs (Q472402): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2014.09.009 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2143482081 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1408.1983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4100121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multicolor Ramsey numbers for complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The History of Degenerate (Bipartite) Extremal Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised Ramsey numbers for small graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree Ramsey numbers for cycles and blowups of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree Ramsey Numbers of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-color Ramsey numbers of even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Turán function of even cycles / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2014.09.009 / rank
 
Normal rank

Latest revision as of 18:34, 9 December 2024

scientific article
Language Label Description Also known as
English
Decomposition of bounded degree graphs into \(C_4\)-free subgraphs
scientific article

    Statements

    Identifiers

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