\(C_{2k}\)-saturated graphs with no short odd cycles (Q2334067): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2896264327 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1810.05772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle-saturated graphs of minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum <i>C</i><sub>5</sub>‐saturated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: All minimum C5-saturated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of minimum saturated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle-Saturated Graphs with Minimum Number of Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Turán problems for even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Turán problem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive upper bounds for cycle-saturated graphs of minimum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saturated graphs with minimal number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges in a minimum \(C_6\)-saturated graph / rank
 
Normal rank

Latest revision as of 20:49, 20 July 2024

scientific article
Language Label Description Also known as
English
\(C_{2k}\)-saturated graphs with no short odd cycles
scientific article

    Statements

    Identifiers