Results 21 to 30 of about 566 (185)
A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2
Algorithms, 2021 Cicerone and Di Stefano defined and studied the class of k-distance-hereditary graphs, i.e., graphs where the distance in each connected induced subgraph is at most k times the distance in the whole graph. The defined graphs represent a generalization of
Serafino Cicerone
doaj +1 more source
On Forbidden Induced Subgraphs for Unit Disk Graphs [PDF]
Discrete & Computational Geometry, 2018 A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active study of unit disk graphs very little is known about minimal forbidden induced subgraphs for this class. We found
Aistis Atminas, Viktor Zamaraev
openaire +3 more sources
The graph grabbing game on {0,1}-weighted graphs
Results in Applied Mathematics, 2019 The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +1 more source
Toughness, Forbidden Subgraphs and Pancyclicity [PDF]
, 2021 Motivated by several conjectures due to Nikoghosyan, in a recent article due to Li et al., the aim was to characterize all possible graphs H such that every 1-tough H-free graph is hamiltonian. The almost complete answer was given there by the conclusion
Broersma, Hajo; id_orcid +2 more
core +1 more source
Forbidden subgraph pairs for traceability of block-chains
Electronic Journal of Graph Theory and Applications, 2013 A block-chain is a graph whose block graph is a path, i.e. it is either a $P_1$, a $P_2$, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable if it contains a Hamilton path.
Binlong Li +2 more
doaj +1 more source
On minimal forbidden subgraph characterizations of balanced graphs [PDF]
, 2013 Artículo de publicación ISIA graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix.
Safe, Martín D. +9 more
core +1 more source
Cops and robbers on graphs with a set of forbidden induced subgraphs [PDF]
Theoretical Computer Science, 2020 It is known that the class of all graphs not containing a graph $H$ as an induced subgraph is cop-bounded if and only if $H$ is a forest whose every component is a path. In this study, we characterize all sets $\mathscr{H}$ of graphs with some $k\in \mathbb{N}$ bounding the diameter of members of $\mathscr{H}$ from above, such that $\mathscr{H}$-free ...
Masood Masjoody, Ladislav Stacho
openaire +3 more sources
Characterising and recognising game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Consider a vertex colouring game played on a simple graph with $k$ permissible colours. Two players, a maker and a breaker, take turns to colour an uncoloured vertex such that adjacent vertices receive different colours.
Dominique Andres, Edwin Lock
doaj +1 more source
Planar graph coloring with forbidden subgraphs : why trees and paths are dangerous [PDF]
, 2002 We consider the problem of coloring a planar graph with the minimum number of colors such that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem.
Penttonen, M. +5 more
core +2 more sources
Electronic Notes in Discrete Mathematics, 2017 In descending generality I survey: five partial orderings of graphs, the induced-subgraph ordering, and examples like perfect, threshold, and mock threshold graphs. The emphasis is on how the induced subgraph ordering differs from other popular orderings and leads to different basic questions.
openaire +4 more sources