Results 31 to 40 of about 168,763 (311)
Concept maps as a novel assessment tool in medical education [version 3; peer review: 2 approved]
MedEdPublish, 2022 Background: Concept Maps (CMs) have been used in a Problem-Based Learning (PBL) setting as complementary tools to current educational techniques for enhancing medical student knowledge and critical thinking. We conducted a pilot study that used CMs in a
Nicoletta Nicolaou +4 more
doaj +1 more source
On the choosability of -minor-free graphs
Combinatorics, Probability and Computing, 2023 AbstractGiven a graph $H$ , let us denote by $f_\chi (H)$ and $f_\ell (H)$ , respectively, the maximum chromatic number and the maximum list chromatic number of $H$ -minor-free graphs. Hadwiger’s famous colouring conjecture from 1943 states that $f_\chi (K_t)=t-1$ for every $t \ge 2$ .
Olivier Fischer, Raphael Steiner
openaire +3 more sources
Coalition structure generation over graphs [PDF]
, 2012 We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) → R over the subsets of nodes, the problem is to find a partition of N into ...
Polukarov, Maria +5 more
core +1 more source
Graph minors and the crossing number of graphs
Electronic Notes in Discrete Mathematics, 2007 Abstract There are three general lower bound techniques for the crossing numbers of graphs, all of which can be traced back to Leighton's work on applications of crossing number in VLSI: the Crossing Lemma, the Bisection Method, and the Embedding Method. In this contribution, we sketch their adaptations to the minor crossing number.
Drago Bokal +3 more
openaire +1 more source
On the extremal function for graph minors [PDF]
Journal of Graph Theory, 2022 AbstractFor a graph , let , where means that is a minor of . We show that if has average degree , then where is an explicitly defined constant. This bound matches a corresponding lower bound shown to hold for almost all such by Norin, Reed, Wood and the first author.
Andrew Thomason 0001, Matthew Wales
openaire +3 more sources
Density of universal classes of series-parallel graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A class of graphs $\mathcal{C}$ ordered by the homomorphism relation is universal if every countable partial order can be embedded in $\mathcal{C}$. It was shown in [ZH] that the class $\mathcal{C_k}$ of $k$-colorable graphs, for any fixed $k≥3$, induces
Jaroslav Nešetřil, Yared Nigussie
doaj +1 more source
On cut polytopes and graph minors [PDF]
Discrete Optimization, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konstantinos Kaparis +2 more
openaire +2 more sources
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes [PDF]
, 2020 Let G be a graph class. We say that a graph G is a k-apex of G if G contains a set S of at most k vertices such that G⧵S belongs to G. We prove that if G is minor-closed, then there is an algorithm that either returns a set S certifying that G is a k ...
Stamoulis, Giannos +2 more
core +1 more source
k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms
, 2022 International audienceLet G be a minor-closed graph class. We say that a graph G is a k-apex of G if G contains a set S of at most k vertices such that G \ S belongs to G. We denote by Ak(G) the set of all graphs that are k-apices of G.
Stamoulis, Giannos +2 more
core +1 more source
PENERAPAN GRAFIK PENGENDALIAN DEMERIT TERHADAP DATA KUALITATATIF
Media Statistika, 2009 A product is represented as inappropriate considered into minor category up to critical, which than given by weight at characteristic of the inappropriate as a according to its importance level. Ploting all amount of inappropriate at one controller graph
Agus Rusgiyono
doaj +1 more source