3-paths in graphs with bounded average degree (Q274685): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.1859 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2319747975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light edges in degree-constrained graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing 3-paths in normal plane maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum average degree and the oriented chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural property of convex 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing short paths in plane graphs of girth at least 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on 3-paths in plane graphs of girth 4 / rank
 
Normal rank

Revision as of 20:08, 11 July 2024

scientific article
Language Label Description Also known as
English
3-paths in graphs with bounded average degree
scientific article

    Statements

    3-paths in graphs with bounded average degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 April 2016
    0 references
    average degree
    0 references
    structural property
    0 references
    3-path
    0 references
    degree sequence
    0 references

    Identifiers