On quadrilaterals in a graph (Q1301667): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent cycles with limited size in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of independent cycles in a bipartite graph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(99)00053-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995770245 / rank
 
Normal rank

Latest revision as of 08:52, 30 July 2024

scientific article
Language Label Description Also known as
English
On quadrilaterals in a graph
scientific article

    Statements

    On quadrilaterals in a graph (English)
    0 references
    0 references
    0 references
    0 references
    12 September 1999
    0 references
    independent cycles
    0 references
    independent triangles
    0 references
    minimum degree
    0 references
    quadrilaterals
    0 references

    Identifiers