Results 41 to 50 of about 11,475 (265)
Cross-Composition: A New Technique for Kernelization Lower Bounds [PDF]
, 2010 We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance of Q with polynomially bounded parameter value can express the logical OR of
Bodlaender, Hans L. +2 more
core +5 more sources
One-Three Join: A Graph Operation and Its Consequences
Discussiones Mathematicae Graph Theory, 2017 In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained ...
Shalu M.A., Devi Yamini S.
doaj +1 more source
Clique-transversal sets and clique-coloring in planar graphs
European Journal of Combinatorics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shan, Erfang +2 more
openaire +1 more source
Coloring intersection graphs of arc-connected sets in the plane [PDF]
, 2014 A family of sets in the plane is simple if the intersection of its any subfamily is arc-connected, and it is pierced by a line $L$ if the intersection of its any member with $L$ is a nonempty segment.
Lasoń, Michał +3 more
core +2 more sources
On the on-line coloring of unit interval graphs with proper interval representation [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe define the problem as a two-player game between Algorithm and Builder. The game is played in rounds. Each round, Builder presents an interval that is neither contained in nor contains any previously presented interval.
Israel R. Curbelo, Hannah R. Malko
doaj +1 more source
A DSATUR-based algorithm for the Equitable Coloring Problem [PDF]
, 2015 This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit.
Méndez-Díaz, Isabel +2 more
core +2 more sources
Critical graphs for clique-coloring
Electronic Notes in Discrete Mathematics, 2000 Abstract We consider the NP-complete problem of coloring the vertices of a graph so that no maximal clique of size at least two is monocolored. A basic property of graph colorations is that a coloration of a graph is also a good coloration of all subgraphs. This property allows to define various notions of ‘critical graphs’.
Meziane Aider, Sylvain Gravier
openaire +1 more source
Combinatorial Problems on $H$-graphs
, 2017 Bir\'{o}, Hujter, and Tuza introduced the concept of $H$-graphs (1992), intersection graphs of connected subgraphs of a subdivision of a graph $H$. They naturally generalize many important classes of graphs, e.g., interval graphs and circular-arc graphs.
Chaplick, Steven, Zeman, Peter
core +1 more source
The Anatomical Record, EarlyView.Abstract The Aliança Formation (Jatobá Basin) represents lacustrine deposits formed in oxygenated waters that hosted a diverse fauna, including Hybodontiform sharks. Within this group, the Family Lonchidiidae comprises 11 valid genera, with Parvodus previously reported in Brazilian deposits from the Brejo Santo Formation (Araripe Basin, Late Jurassic ...
Larissa de Souza Ribeiro +1 more
wiley +1 more source
A Note on Lower Bounds for Induced Ramsey Numbers
Discussiones Mathematicae Graph Theory, 2019 We say that a graph F strongly arrows a pair of graphs (G,H) and write F →ind$\mathop \to \limits^{{\rm{ind}}} $(G,H) if any 2-coloring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F.
Gorgol Izolda
doaj +1 more source