Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AutoGraphiX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Planar Map is Four Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sale of the century? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3318779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compilation of relations between graph invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compilation of relations between graph invariants—supplement I / rank
 
Normal rank
Property / cites work
 
Property / cites work: INGRID: A graph invariant manipulator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast generation of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for extremal graphs. I: The AutoGraphiX system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Man-machine theorem proving in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for extremal graphs 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjectures of Graffiti / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4800089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorph-Free Exhaustive Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the Folkman numberFe(3, 3; 5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank

Latest revision as of 14:01, 6 June 2024

scientific article
Language Label Description Also known as
English
Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
scientific article

    Statements

    Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (English)
    0 references
    0 references
    0 references
    14 February 2004
    0 references
    Graph
    0 references
    Conjecture
    0 references
    Automated system
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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