Cycle-maximal triangle-free graphs (Q472981): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1310.5172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of cycles in a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphentheoretische Extremalprobleme / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a paper by D. Seinsche / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the locality of distributed routing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Dense Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Cycles in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Rademacher-Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to make a graph bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ODD Cycles of Specified Length in Non-Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-Free Graphs with High Minimal Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free four-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of cycles in outerplanar and series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose every independent set has a common neighbour / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of cycles in a Hamiltonian graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ECL<sup>i</sup>PS<sup>e</sup> – From LP to CLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cycles in a Hamilton graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3811427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimations for the number of cycles in a graph / rank
 
Normal rank

Latest revision as of 08:32, 9 July 2024

scientific article
Language Label Description Also known as
English
Cycle-maximal triangle-free graphs
scientific article

    Statements

    Cycle-maximal triangle-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    extremal graph theory
    0 references
    cycle
    0 references
    triangle-free
    0 references
    regular graph
    0 references
    matrix permanent
    0 references
    \(\#\mathrm P\)-complete
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references