X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (134) 134
graphs (109) 109
mathematics, applied (64) 64
mathematics - combinatorics (63) 63
mathematical analysis (54) 54
discrete mathematics and combinatorics (51) 51
algorithms (50) 50
theoretical computer science (46) 46
domination (39) 39
computer science (33) 33
graph (25) 25
graph theory (25) 25
matching (22) 22
convexity (19) 19
trees (19) 19
combinatorics (17) 17
independence (17) 17
applied mathematics (16) 16
management science (16) 16
computer science, theory & methods (14) 14
hull number (14) 14
independent set (14) 14
complexity (13) 13
discrete mathematics (13) 13
integers (13) 13
studies (13) 13
graph convexity (12) 12
lower bounds (12) 12
polynomials (12) 12
radon number (12) 12
computational theory and mathematics (11) 11
connectivity (11) 11
dynamic monopoly (11) 11
geodetic convexity (11) 11
hamiltonian cycle (11) 11
analysis (10) 10
computer science, information systems (10) 10
crushing, pulverising, or disintegrating (10) 10
crushing, pulverising, or disintegrating in general (10) 10
cycle (10) 10
milling grain (10) 10
number (10) 10
performing operations (10) 10
preparatory treatment of grain for milling (10) 10
reconstruction (10) 10
sets (10) 10
transporting (10) 10
upper bounds (10) 10
combinatorial analysis (9) 9
graph algorithms (9) 9
induced matching (9) 9
intersection graph (9) 9
interval graph (9) 9
operations research & management science (9) 9
radon partition (9) 9
total domination (9) 9
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (8) 8
algorithm (8) 8
coloring (8) 8
forbidden induced subgraph (8) 8
geodetic number (8) 8
girth (8) 8
hardness (8) 8
tree (8) 8
unit interval graph (8) 8
circulant graph (7) 7
distance graph (7) 7
domination number (7) 7
engineering design (7) 7
forests (7) 7
mathematical models (7) 7
optimization (7) 7
packing (7) 7
recognition (7) 7
size (7) 7
05c38 (6) 6
algorithm analysis and problem complexity (6) 6
approximation algorithm (6) 6
bounds (6) 6
carathéodory number (6) 6
clique (6) 6
combinatorial problems (6) 6
cycle spectrum (6) 6
degree sequence (6) 6
discrete mathematics in computer science (6) 6
hulls (6) 6
independence number (6) 6
intervals (6) 6
inverse domination (6) 6
networks (6) 6
operations research/decision theory (6) 6
proper (6) 6
proper interval graph (6) 6
strong matching (6) 6
theory of computation (6) 6
uniquely restricted matching (6) 6
05c69 (5) 5
apexes (5) 5
betweenness (5) 5
bipartite graph (5) 5
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Annals of Operations Research, ISSN 0254-5330, 9/2019, Volume 280, Issue 1, pp. 47 - 63
... José D. Alvarado 1 · Simone Dantas 1 · Dieter Rautenbach 2 Published online: 21 February 2019 © Springer Science+Business Media, LLC, part of Springer Nature 2019... 
Graph sandwich problem | Forbidden induced subgraph | Prime graph | Business and Management | Operations Research/Decision Theory | Theory of Computation | Combinatorics | Homogeneous set | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SET | GRAPHS | Graphs | Graph theory | Polynomials | Diamonds | Dogs
Journal Article
Theoretical computer science, ISSN 0304-3975, 06/2019, Volume 772, pp. 46 - 57
For a graph G and an integer-valued function τ on its vertex set, a dynamic monopoly is a set of vertices of G such that iteratively adding to it vertices u of... 
Dynamic monopoly | Vaccination | COMPUTER SCIENCE, THEORY & METHODS | EPIDEMICS | DYNAMIC MONOPOLIES | GRAPHS
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 02/2020, Volume 40, Issue 1, pp. 355 - 360
We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number ) of a graph . More specifically, we show... 
girth | Moore bound | zero forcing | 05C69 | MATHEMATICS | MINIMUM RANK | 05c69 | moore bound
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 11/2015, Volume 31, Issue 6, pp. 2335 - 2345
...Graphs and Combinatorics (2015) 31:2335–2345 DOI 10.1007/s00373-014-1494-1 ORIGINAL PAPER Cycle Lengths of Hamiltonian P -free Graphs Dirk Meierling · Dieter... 
05C45 | Hamiltonian cycle | Cycle length | Cycle spectrum | Mathematics | Engineering Design | Combinatorics | 05C38
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2019, Volume 260, pp. 256 - 261
For a graph G and an integer-valued threshold function τ on its vertex set, a dynamic monopoly is a set of vertices of G such that iteratively adding to it... 
Interval graph | Dynamic monopoly | Target set selection | MATHEMATICS, APPLIED | Monopolies | Graphs | Polynomials | Apexes | Mathematical analysis
Journal Article
Discrete mathematics, ISSN 0012-365X, 04/2018, Volume 341, Issue 4, pp. 1032 - 1035
We consider a variant of a pursuit and evasion game studied independently by Britnell and Wildon as well as Haslegrave. In their game, a cat has to catch an... 
Pursuit and evasion game | GRAPH | MATHEMATICS | ROBBER
Journal Article
SIAM journal on discrete mathematics, ISSN 0895-4801, 2014, Volume 28, Issue 1, pp. 468 - 473
...SIAM J. DISCRETE MATH. c Vol. 28, No. 1, pp. 468473 INDUCED MATCHINGS IN SUBCUBIC GRAPHS FELIX JOOS, DIETER RAUTENBACH, AND THOMAS SASSE Abstract. We prove... 
Strong chromatic index | Strong matching | Induced matching | MATHEMATICS, APPLIED | strong chromatic index | strong matching | induced matching
Journal Article
Theoretical computer science, ISSN 0304-3975, 04/2018, Volume 720, pp. 64 - 72
It is an easy observation that a natural greedy approach yields a (d−O(1))-factor approximation algorithm for the maximum induced matching problem in d-regular... 
Local search | Strong matching | Induced matching | COMPUTER SCIENCE, THEORY & METHODS | MAXIMUM INDUCED MATCHINGS | BIPARTITE GRAPHS
Journal Article
Discrete mathematics, ISSN 0012-365X, 07/2016, Volume 339, Issue 7, pp. 1878 - 1883
The independence number α(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s... 
Hypergraph | Triangle-free | Uniform | Linear | Double linear | Independence | Lower bounds | Mathematical analysis | Images | Graphs | Lithium | Shearers | Graph theory
Journal Article
Discrete mathematics, ISSN 0012-365X, 12/2015, Volume 338, Issue 12, pp. 2374 - 2377
We characterize the graphs for which the independence number equals the packing number. As a consequence we obtain simple structural descriptions of the graphs... 
Matching | Independent set | Induced matching | Packing | MATHEMATICS | MAXIMUM INDUCED MATCHINGS | SIZE | GRAPHS | Integers | Descriptions | Graphs | Mathematical analysis
Journal Article
Discrete mathematics, ISSN 0012-365X, 11/2016, Volume 339, Issue 11, pp. 2715 - 2720
As a common generalization of the domination number and the total domination number of a graph G, we study the k-component domination number γk(G) of G defined... 
Domination | Total domination | MATHEMATICS | GIRTH | GRAPHS | Integers | Graphs | Graph theory | Mathematical analysis | Images
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 1/2016, Volume 32, Issue 1, pp. 93 - 101
... Joos · Dieter Rautenbach Received: 28 November 2013 / Revised: 22 December 2014 / Published online: 19 February 2015 © Springer Japan 2015 Abstract If G is a claw... 
Hamiltonian cycle | Claw-free graph | Cycle spectrum | Mathematics | Engineering Design | Combinatorics | 05C38 | Texts | Graphs | Combinatorial analysis
Journal Article
Discrete mathematics, ISSN 0012-365X, 12/2015, Volume 338, Issue 12, pp. 2318 - 2319
We show that a factor-critical graph of order n has exactly n near-perfect matchings if and only if it is a connected graph whose blocks are all odd cycles.... 
Matching | Near-perfect matching | Factor-critical | MATHEMATICS | Mathematical analysis | Graphs
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 2/2017, Volume 33, Issue 2, pp. 365 - 372
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2012, Volume 160, Issue 12, pp. 1872 - 1874
In the Binary Paint Shop Problem proposed by Epping et al. (2004) [4] one has to find a 0/1-coloring of the letters of a word in which every letter from some... 
Evenly laminar hypergraph | Greedy algorithm | Binary paint shop problem | Odd transversal | PAINT SHOP PROBLEM | MATHEMATICS, APPLIED | Algorithms | Coloring | Greedy algorithms | Mathematical analysis | Alphabets | Color | Optimization | Laminar | Painting | Computer Science | Operations Research
Journal Article
Theoretical computer science, ISSN 0304-3975, 11/2015, Volume 607, pp. 83 - 95
This paper studies new complexity aspects of P3-convexity restricted to planar graphs with bounded maximum degree. More specifically, we are interested in... 
Parametrization | W-hard | FPT | NP-completeness
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 11/2017, Volume 37, Issue 4, pp. 953 - 961
For a graph G, let R(G) and y (G) denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that y (G) ≤ R(G)... 
Roman domination | 2-rainbow domination | MATHEMATICS | GRAPHS
Journal Article
Discrete mathematics, ISSN 0012-365X, 2006, Volume 306, Issue 13, pp. 1456 - 1461
Nishimura et al. [On graph powers for leaf-labeled trees, J. Algorithms 42 (2002) 69–108] define a k-leaf root of a graph G = ( V G , E G ) as a tree T = ( V T... 
Forbidden induced subgraph | Leaf root | MATHEMATICS | leaf root | forbidden induced subgraph | Computer science | Algorithms
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.