Results 91 to 100 of about 3,997 (179)

On Vertices Enforcing a Hamiltonian Cycle

Discussiones Mathematicae Graph Theory, 2013
A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian.
Fabrici Igor, Hexel Erhard, Jendrol’ Stanislav   +2 more
doaj   +1 more source

Aggregative context-aware fitness functions based on feature selection for evolutionary learning of characteristic graph patterns

Vietnam Journal of Computer Science, 2018
We propose aggregative context-aware fitness functions based on feature selection for evolutionary learning of characteristic graph patterns. The proposed fitness functions estimate the fitness of a set of correlated individuals rather than the sum of ...
Fumiya Tokuhara, Tetsuhiro Miyahara, Tetsuji Kuboyama, Yusuke Suzuki, Tomoyuki Uchida   +4 more
doaj   +1 more source

Bipartite Minors [PDF]

, 2013
We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain $K_{3,3}$ as a bipartite minor.
Chudnovsky, Maria, Kalai, Gil, Nevo, Eran, Novik, Isabella, Seymour, Paul   +4 more
core   +1 more source

Zonal Labeling of Graphs

Indonesian Journal of Combinatorics
A planar graph is said to be zonal when is possible to label its vertices with the nonzero elements of ℤ3, in such a way that the sum of the labels of the vertices on the boundary of each zone is 0 in ℤ3.
Christian Barrientos, Sarah Minion
doaj   +1 more source

A Survey of Maximal k-Degenerate Graphs and k-Trees

Theory and Applications of Graphs
This article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj   +1 more source

Vertex Colorings without Rainbow Subgraphs

Discussiones Mathematicae Graph Theory, 2016
Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G ...
Goddard Wayne, Xu Honghai
doaj   +1 more source

A Note on the Fair Domination Number in Outerplanar Graphs

Discussiones Mathematicae Graph Theory, 2020
For k ≥ 1, a k-fair dominating set (or just kFD-set), in a graph G is a dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V − S. The k-fair domination number of G, denoted by fdk(G), is the minimum cardinality of a kFD-set. A fair dominating
Hajian Majid, Rad Nader Jafari
doaj   +1 more source

Strict confluent drawing

Journal of Computational Geometry, 2016
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be ...
David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek   +5 more
doaj   +1 more source

On Separating Path and Tree Systems in Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
We explore the concept of separating systems of vertex sets of graphs. A separating system of a set $X$ is a collection of subsets of $X$ such that for any pair of distinct elements in $X$, there exists a set in the separating system that contains ...
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky   +8 more
doaj   +1 more source

Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]

Algorithmica, 2022
Golovach PA, Zehavi M.
europepmc   +1 more source