When.com Web Search

  1. Ads

    related to: free graphs for kids downloads math playground

Search results

  1. Results From The WOW.Com Content Network
  2. Mia's Math Adventure: Just in Time! - Wikipedia

    en.wikipedia.org/wiki/Mia's_Math_Adventure:_Just...

    Mia's Math Adventure: Just in Time! is the third title of the Mia's Big Adventure Collection software series created by Kutoka Interactive. Released in 2001 in Canada and the United States , the game teaches mathematics to children between 6 and 10 years old.

  3. Squaregraph - Wikipedia

    en.wikipedia.org/wiki/Squaregraph

    The graph obtained from a squaregraph by making a vertex for each zone (an equivalence class of parallel edges of quadrilaterals) and an edge for each two zones that meet in a quadrilateral is a circle graph determined by a triangle-free chord diagram of the unit disk.

  4. Chvátal graph - Wikipedia

    en.wikipedia.org/wiki/Chvátal_graph

    This graph is not vertex-transitive: its automorphism group has one orbit on vertices of size 8, and one of size 4.. The Chvátal graph is Hamiltonian, and plays a key role in a proof by Fleischner & Sabidussi (2002) that it is NP-complete to determine whether a triangle-free Hamiltonian graph is 3-colorable.

  5. Discover the best free online games at AOL.com - Play board, card, casino, puzzle and many more online games while chatting with others in real-time.

  6. Math Rabbit - Wikipedia

    en.wikipedia.org/wiki/Math_Rabbit

    Math Rabbit is a spin-off of the Reader Rabbit educational video game series. It was published by The Learning Company in 1986 for MS-DOS and Apple II . A Deluxe version was released in 1993 for MS-DOS, Mac , and Windows 3.x .

  7. Triangle-free graph - Wikipedia

    en.wikipedia.org/wiki/Triangle-free_graph

    An independent set of ⌊ ⌋ vertices (where ⌊ ⌋ is the floor function) in an n-vertex triangle-free graph is easy to find: either there is a vertex with at least ⌊ ⌋ neighbors (in which case those neighbors are an independent set) or all vertices have strictly less than ⌊ ⌋ neighbors (in which case any maximal independent set must have at least ⌊ ⌋ vertices). [4]