Graphs and Combinatorics, ISSN 0911-0119, 1/2019, Volume 35, Issue 1, pp. 67 - 89

A graph G is said to be pancyclic if G contains cycles of lengths from 3 to |V(G)|. For a positive integer i, we use $$Z_i$$ Z i to denote the graph obtained...

Forbidden subgraphs | Mathematics | Engineering Design | Combinatorics | Claw-free | Pancyclic

Forbidden subgraphs | Mathematics | Engineering Design | Combinatorics | Claw-free | Pancyclic

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2018, Volume 244, pp. 214 - 217

A k-bisection of a bridgeless cubic graph G is a 2-colouring of its vertex set such that the colour classes have the same cardinality and all connected...

Bisection | Colouring | Cubic graph | Claw-free graph | MATHEMATICS, APPLIED | COMPONENTS | PARTITIONS

Bisection | Colouring | Cubic graph | Claw-free graph | MATHEMATICS, APPLIED | COMPONENTS | PARTITIONS

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 01/2019, Volume 754, pp. 3 - 15

Domination is one of the classical subjects in structural graph theory and in graph algorithms. The MINIMUM DOMINATING SET problem and many of its variants are...

Irredundant sets | Claw-free graphs | Enumeration | MINIMAL DOMINATING SETS | COMPUTER SCIENCE, THEORY & METHODS | Algorithms

Irredundant sets | Claw-free graphs | Enumeration | MINIMAL DOMINATING SETS | COMPUTER SCIENCE, THEORY & METHODS | Algorithms

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 03/2014, Volume 75, Issue 3, pp. 203 - 230

In 1988, Chvátal and Sbihi (J Combin Theory Ser B 44(2) (1988), 154–176) proved a decomposition theorem for claw‐free perfect graphs. They showed that...

quasi‐line graph | claw‐free | perfect | graph structure | trigraph | quasi-line graph | claw-free | MATHEMATICS

quasi‐line graph | claw‐free | perfect | graph structure | trigraph | quasi-line graph | claw-free | MATHEMATICS

Journal Article

Journal of combinatorial optimization, ISSN 1573-2886, 2014, Volume 31, Issue 3, pp. 1090 - 1110

Let $$G$$ G be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter,...

Claw-free | Convex and Discrete Geometry | Total dominating set | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | 05C69 | Disjunctive total dominating set | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | FREE CUBIC GRAPHS | CLAW-FREE GRAPHS

Claw-free | Convex and Discrete Geometry | Total dominating set | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Operation Research/Decision Theory | Combinatorics | 05C69 | Disjunctive total dominating set | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | FREE CUBIC GRAPHS | CLAW-FREE GRAPHS

Journal Article

Theoretical Computer Science, ISSN 0304-3975, 10/2013, Volume 510, pp. 1 - 12

The Shortest Path Reconfiguration problem has as input a graph G with unit edge lengths, with vertices s and t, and two shortest st-paths P and Q. The question...

Shortest path | Chordal graph | PSPACE-hard | Claw-free graph | Reconfiguration | Reachability | METIS-302544 | EWI-23842 | IR-89578 | COMPUTER SCIENCE, THEORY & METHODS | Algorithms

Shortest path | Chordal graph | PSPACE-hard | Claw-free graph | Reconfiguration | Reachability | METIS-302544 | EWI-23842 | IR-89578 | COMPUTER SCIENCE, THEORY & METHODS | Algorithms

Journal Article

Journal of graph theory, ISSN 0364-9024, 2013, Volume 73, Issue 2, pp. 146 - 160

In this article, we consider forbidden subgraphs for hamiltonicity of 3‐connected claw‐free graphs. Let Zi be the graph obtained from a triangle by attaching a...

claw‐free graphs | Hamiltonian cycle | forbidden subgraphs | Ryjáčeks closure | Ryjáč eks closure | claw-free graphs | MATHEMATICS | Ryjaeks closure | CLOSURE

claw‐free graphs | Hamiltonian cycle | forbidden subgraphs | Ryjáčeks closure | Ryjáč eks closure | claw-free graphs | MATHEMATICS | Ryjaeks closure | CLOSURE

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 1/2019, Volume 35, Issue 1, pp. 201 - 206

A graph $$G=(V(G), E(G))$$ G = ( V ( G ) , E ( G ) ) is supereulerian if it has a spanning Eulerian subgraph. Let $$\ell (G)$$ ℓ ( G ) be the maximum number of...

5-regular graph | Large size | Supereulerian | Claw-free | Mathematics | Engineering Design | Eulerian subgraph | Combinatorics | MATHEMATICS | Graphs | Graph theory

5-regular graph | Large size | Supereulerian | Claw-free | Mathematics | Engineering Design | Eulerian subgraph | Combinatorics | MATHEMATICS | Graphs | Graph theory

Journal Article

Graphs and combinatorics, ISSN 1435-5914, 2019, Volume 35, Issue 4, pp. 815 - 825

Using a graph and its colorings we can define a chromatic symmetric function. Stanley’s celebrated conjecture about the e-positivity of claw-free...

Claw-free graphs | e -positive | Mathematics | Engineering Design | Combinatorics | Chromatic symmetric function | MATHEMATICS | e-positive | Graphs | Questions | Diamonds

Claw-free graphs | e -positive | Mathematics | Engineering Design | Combinatorics | Chromatic symmetric function | MATHEMATICS | e-positive | Graphs | Questions | Diamonds

Journal Article

Canadian journal of mathematics, ISSN 0008-414X, 02/2019, Volume 71, Issue 1, pp. 113 - 129

Is there some absolute $\unicode[STIX]{x1D700}>0$ such that for any claw-free graph $G$ , the chromatic number of the square of $G$ satisfies...

Article | Erdős-Nešetřil conjecture | claw-free graphs | graph colouring | MATHEMATICS | Erdos-Nesetril conjecture | NUMBER | STABLE SET | ALGORITHM | Graphs | Mathematics

Article | Erdős-Nešetřil conjecture | claw-free graphs | graph colouring | MATHEMATICS | Erdos-Nesetril conjecture | NUMBER | STABLE SET | ALGORITHM | Graphs | Mathematics

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 9/2014, Volume 30, Issue 5, pp. 1099 - 1122

We investigate pairs of forbidden subgraphs that imply a 3-connected graph is Hamiltonian-connected. In particular we show that the pair {K 1,3, P 9} is such a...

Closure | Hamilton-connected | Claw-free | Dominating | Mathematics | Engineering Design | 3-Connected | Combinatorics | MATHEMATICS | CLAW-FREE GRAPHS | Computer science | Graph theory | Graphs | Combinatorial analysis

Closure | Hamilton-connected | Claw-free | Dominating | Mathematics | Engineering Design | 3-Connected | Combinatorics | MATHEMATICS | CLAW-FREE GRAPHS | Computer science | Graph theory | Graphs | Combinatorial analysis

Journal Article

Graphs and combinatorics, ISSN 1435-5914, 2019, Volume 35, Issue 5, pp. 1129 - 1138

A paired-dominating set of a graph G is a dominating set D with the additional requirement that the induced subgraph G[D] contains a perfect matching. We prove...

Dominating set | Total dominating set | Cubic graph | Claw-free graph | Mathematics | Engineering Design | Combinatorics | 05C69 | Paired-dominating set | MATHEMATICS | NUMBER | Graph theory | Original Paper

Dominating set | Total dominating set | Cubic graph | Claw-free graph | Mathematics | Engineering Design | Combinatorics | 05C69 | Paired-dominating set | MATHEMATICS | NUMBER | Graph theory | Original Paper

Journal Article

ACM Transactions on Algorithms (TALG), ISSN 1549-6325, 05/2019, Volume 15, Issue 2, pp. 1 - 90

We algorithmize the structural characterization for claw-free graphs by Chudnovsky and Seymour. Building on this result, we show that D ominating S et on...

fixed-parameter tractable | polynomial kernel | Claw-free graphs | dominating set | connected dominating set | MATHEMATICS, APPLIED | SET | PARTITION REFINEMENT | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS

fixed-parameter tractable | polynomial kernel | Claw-free graphs | dominating set | connected dominating set | MATHEMATICS, APPLIED | SET | PARTITION REFINEMENT | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS

Journal Article

Discrete mathematics, ISSN 0012-365X, 11/2020, Volume 343, Issue 11, p. 112076

The Z-domination game is a variant of the domination game in which each newly selected vertex u in the game must have a not yet dominated neighbor, but after...

Graph product | Weakly claw-free graph | Z-domination game | Claw-free graph | Domination game

Graph product | Weakly claw-free graph | Z-domination game | Claw-free graph | Domination game

Journal Article

Discrete Mathematics, Algorithms and Applications, ISSN 1793-8309, 10/2018, Volume 10, Issue 5

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 11/2018, Volume 34, Issue 6, pp. 1371 - 1384

Adynamic coloring of the vertices of a graph G starts with an initial subset S of colored vertices, with all remaining vertices being non-colored. At each...

Total forcing sets | Cycle cover | Cubic | Claw-free | Zero forcing sets | MATHEMATICS | NUMBER | BOUNDS | PROOF | TOTAL DOMINATION | CONJECTURE | Coloring | Graphs | Graph theory | Apexes

Total forcing sets | Cycle cover | Cubic | Claw-free | Zero forcing sets | MATHEMATICS | NUMBER | BOUNDS | PROOF | TOTAL DOMINATION | CONJECTURE | Coloring | Graphs | Graph theory | Apexes

Journal Article

中国科学：数学英文版, ISSN 1674-7283, 2017, Volume 60, Issue 1, pp. 177 - 188

We consider even factors with a bounded number of components in the n-times iterated line graphs L^n（G）. We present a characterization of a simple graph G such...

线图 | 简单图 | 迭代 | 无爪图 | 因子 | 有限数 | 有界 | 最小数 | 05C75 | 05C45 | even factor | claw-free graph | Mathematics | Applications of Mathematics | iterated line graph | branch | closure | 05C38 | MATHEMATICS | MATHEMATICS, APPLIED | HAMILTONIAN INDEX | EULERIAN GRAPHS | CLAW-FREE GRAPHS | SUPEREULERIAN GRAPHS

线图 | 简单图 | 迭代 | 无爪图 | 因子 | 有限数 | 有界 | 最小数 | 05C75 | 05C45 | even factor | claw-free graph | Mathematics | Applications of Mathematics | iterated line graph | branch | closure | 05C38 | MATHEMATICS | MATHEMATICS, APPLIED | HAMILTONIAN INDEX | EULERIAN GRAPHS | CLAW-FREE GRAPHS | SUPEREULERIAN GRAPHS

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 08/2017, Volume 37, Issue 3, pp. 649 - 663

A graph on vertices is said to be ( if every set of vertices in is contained in a cycle of length for each ∈ { +1, . . . , }. This property, which generalizes...

pancyclic | 05C45 | hamiltonian | claw-free | forbidden subgraph | cycle | 05C38 | Forbidden subgraph | Claw-free | Hamiltonian | Cycle | Pancyclic | MATHEMATICS | GRAPHS

pancyclic | 05C45 | hamiltonian | claw-free | forbidden subgraph | cycle | 05C38 | Forbidden subgraph | Claw-free | Hamiltonian | Cycle | Pancyclic | MATHEMATICS | GRAPHS

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 3/2016, Volume 32, Issue 2, pp. 685 - 705

A graph G is $$\{X,Y\}$$ { X , Y } -free if it contains neither X nor Y as an induced subgraph. Pairs of connected graphs X, Y such that every 3-connected...

Forbidden subgraphs | 05C45 | Hamilton-connected | Claw-free graphs | Mathematics | Engineering Design | Combinatorics | Crucial edges | 05C38

Forbidden subgraphs | 05C45 | Hamilton-connected | Claw-free graphs | Mathematics | Engineering Design | Combinatorics | Crucial edges | 05C38

Journal Article

Annals of operations research, ISSN 1572-9338, 2017, Volume 264, Issue 1-2, pp. 287 - 305

Let G be an undirected graph. An edge of G dominates itself and all edges adjacent to it. A subset $$E'$$ E′ of edges of G is an edge dominating set of G, if...

Complexity dichotomy | Business and Management | Operations Research/Decision Theory | NP-completeness | Claw-free graphs | Perfect edge domination | Theory of Computation | Combinatorics | Cubic graphs | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Mathematical research | Graph theory | Research | Minimum weight | Studies | Graphs | Operations research | Algorithms

Complexity dichotomy | Business and Management | Operations Research/Decision Theory | NP-completeness | Claw-free graphs | Perfect edge domination | Theory of Computation | Combinatorics | Cubic graphs | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Mathematical research | Graph theory | Research | Minimum weight | Studies | Graphs | Operations research | Algorithms

Journal Article

No results were found for your search.

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