2017
DOI: 10.1007/978-3-319-51380-5_8
|View full text |Cite
|
Sign up to set email alerts
|

Graphs in Primary School: Playing with Technology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
6
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(8 citation statements)
references
References 4 publications
2
6
0
Order By: Relevance
“…This agrees with the ideas of different authors claiming that the teaching of graph theory should go from the global to the local aspects. For instance, Gibson (2012) designs a sequence of tasks that initially present graphs as integral wholes and sequentially focus on their parts, thus making students pay attention to local concepts such as subgraphs or minimal paths (see also the work of Ferrarello (2017)). Hart and Martin (2018) also emphasize students' ability to detach from the irrelevant characteristics of graphs in order to give more importance to their combinatorial aspects.…”
Section: Discussionmentioning
confidence: 99%
“…This agrees with the ideas of different authors claiming that the teaching of graph theory should go from the global to the local aspects. For instance, Gibson (2012) designs a sequence of tasks that initially present graphs as integral wholes and sequentially focus on their parts, thus making students pay attention to local concepts such as subgraphs or minimal paths (see also the work of Ferrarello (2017)). Hart and Martin (2018) also emphasize students' ability to detach from the irrelevant characteristics of graphs in order to give more importance to their combinatorial aspects.…”
Section: Discussionmentioning
confidence: 99%
“…The next two sessions offer an original approach which differs from those found in previous work [11][12][13][14]. In the second session, we use star polygons to practice Eulerian cycles.…”
Section: Discussionmentioning
confidence: 99%
“…The reasoning stage is mainly devoted to deepening the understanding of Eulerian paths and cycles; Hamiltonian graphs appear briefly in the last session. We finally explain the definition of Eulerian cycle and propose to the participants some activities to distinguish Eulerian and non-Eulerian cycles before presenting the Köningsberg bridges problem, which is frequently used in the literature to introduce graphs [12][13][14].…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations