Discrete mathematics, ISSN 0012-365X, 2018, Volume 341, Issue 12, pp. 3434 - 3440

A strong k-edge-coloring of a graph G is an edge-coloring with k colors in which every color class is an induced matching...

Strong list-chromatic index | Subcubic graphs | Combinatorial nullstellensatz | MATHEMATICS | CHOOSABILITY

Strong list-chromatic index | Subcubic graphs | Combinatorial nullstellensatz | MATHEMATICS | CHOOSABILITY

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2019, Volume 255, pp. 209 - 221

Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exist subclasses in which the packing chromatic number is finite (and small...

Packing colouring | Subcubic graphs | Packing chromatic number | Outerplanar graphs | COLORINGS | MATHEMATICS, APPLIED | SQUARE | PRODUCT | LATTICE | Graphs | Lattices | Computer Science | Discrete Mathematics

Packing colouring | Subcubic graphs | Packing chromatic number | Outerplanar graphs | COLORINGS | MATHEMATICS, APPLIED | SQUARE | PRODUCT | LATTICE | Graphs | Lattices | Computer Science | Discrete Mathematics

Journal Article

Discrete mathematics, ISSN 0012-365X, 06/2014, Volume 324, Issue 1, pp. 41 - 49

A strong edge-coloring of a graph is a proper edge-coloring where the edges at distance at most 2 receive distinct colors...

Discharging method | Strong chromatic index | Planar graph | Strong edge-coloring | INDUCED MATCHINGS | MATHEMATICS | SUBCUBIC GRAPHS | Mathematical analysis | Graphs | Mathematics - Combinatorics

Discharging method | Strong chromatic index | Planar graph | Strong edge-coloring | INDUCED MATCHINGS | MATHEMATICS | SUBCUBIC GRAPHS | Mathematical analysis | Graphs | Mathematics - Combinatorics

Journal Article

Graphs and Combinatorics, ISSN 0911-0119, 9/2016, Volume 32, Issue 5, pp. 1731 - 1747

An edge Roman dominating function of a graph G is a function
$$f:E(G) \rightarrow \{0,1,2\}$$
f
:
E
(
G
)
→
{
0
,
1
,
2
}
satisfying the condition that every edge e...

K_{2, 3}$$ K 2 , 3 -subdivision-free graph | Edge Roman domination | Planar graph | Subcubic graph | Mathematics | Engineering Design | Combinatorics | k -degenerate graph | subdivision-free graph | k-degenerate graph | MATHEMATICS | K-2,K-3-subdivision-free graph

K_{2, 3}$$ K 2 , 3 -subdivision-free graph | Edge Roman domination | Planar graph | Subcubic graph | Mathematics | Engineering Design | Combinatorics | k -degenerate graph | subdivision-free graph | k-degenerate graph | MATHEMATICS | K-2,K-3-subdivision-free graph

Journal Article

Journal of graph theory, ISSN 0364-9024, 2018, Volume 89, Issue 2, pp. 115 - 149

Let k≥3. We prove the following three bounds for the matching number, α′(G), of a graph, G, of order n size m and maximum degree at most k.
If k is odd, then α′(G)≥(k−1k(k2−3))n+(k2−k−2k(k2−3))m−k−1k(k2−3...

convex set | maximum degree | 05C70 | matching number | MATHEMATICS | SUBCUBIC GRAPHS | REGULAR GRAPHS

convex set | maximum degree | 05C70 | matching number | MATHEMATICS | SUBCUBIC GRAPHS | REGULAR GRAPHS

Journal Article

Journal of combinatorial optimization, ISSN 1573-2886, 2018, Volume 36, Issue 4, pp. 1425 - 1438

A graph is locally irregular if the neighbors of every vertex v have degrees distinct from the degree of v...

Locally irregular graph | Locally irregular edge-coloring | Convex and Discrete Geometry | Operations Research/Decision Theory | Subcubic graph | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Bipartite graph | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | SUBGRAPHS | Mathematics - Combinatorics

Locally irregular graph | Locally irregular edge-coloring | Convex and Discrete Geometry | Operations Research/Decision Theory | Subcubic graph | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Bipartite graph | Combinatorics | Optimization | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | SUBGRAPHS | Mathematics - Combinatorics

Journal Article

The Electronic journal of combinatorics, ISSN 1077-8926, 07/2018, Volume 25, Issue 3

The strong chromatic index of a graph G, denoted (')(X)(G),is the least number of colors needed to edge-color G so that edges at distance at most two receive distinct colors...

Strong chromatic index | Strong edge coloring | Sparse graphs | MATHEMATICS | PLANAR GRAPHS | MATHEMATICS, APPLIED | SUBCUBIC GRAPHS

Strong chromatic index | Strong edge coloring | Sparse graphs | MATHEMATICS | PLANAR GRAPHS | MATHEMATICS, APPLIED | SUBCUBIC GRAPHS

Journal Article

Rocznik Akademii Górniczo-Hutniczej im. Stanisława Staszica. Opuscula Mathematica, ISSN 1232-9274, 2018, Volume 38, Issue 6, pp. 795 - 817

A graph G is locally irregular if every two adjacent vertices of G have different degrees...

Subcubic graphs | Locally irregular edge-colouring | Irregular chromatic index | Computer Science | Discrete Mathematics | irregular chromatic index | locally irregular edge-colouring | subcubic graphs

Subcubic graphs | Locally irregular edge-colouring | Irregular chromatic index | Computer Science | Discrete Mathematics | irregular chromatic index | locally irregular edge-colouring | subcubic graphs

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2017, Volume 37, Issue 2, pp. 427 - 441

In this paper we study the problem of interval incidence coloring of subcubic graphs...

subcubic graph | incidence coloring | interval incidence coloring | Subcubic graph | Interval incidence coloring | Incidence coloring | MATHEMATICS | STAR ARBORICITY | EDGE-COLORINGS

subcubic graph | incidence coloring | interval incidence coloring | Subcubic graph | Interval incidence coloring | Incidence coloring | MATHEMATICS | STAR ARBORICITY | EDGE-COLORINGS

Journal Article

10.
Full Text
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs

Discrete Applied Mathematics, ISSN 0166-218X, 03/2018, Volume 237, pp. 116 - 122

A k-coloring of a graph G=(V,E) is called semi-equitable if there exists a partition of its vertex set into independent subsets V1...

Subcubic graphs | Semi-equitable coloring | Equitable coloring | Cubic graphs | MATHEMATICS, APPLIED

Subcubic graphs | Semi-equitable coloring | Equitable coloring | Cubic graphs | MATHEMATICS, APPLIED

Journal Article

Journal of graph theory, ISSN 0364-9024, 2018, Volume 89, Issue 4, pp. 457 - 478

In this article, we address the maximum number of vertices of induced forests in subcubic graphs with girth at least four or five...

subcubic graphs | feedback vertex‐sets | induced forests | feedback vertex-sets | FEEDBACK VERTEX SETS | MATHEMATICS | PLANAR GRAPHS | CUBIC GRAPHS

subcubic graphs | feedback vertex‐sets | induced forests | feedback vertex-sets | FEEDBACK VERTEX SETS | MATHEMATICS | PLANAR GRAPHS | CUBIC GRAPHS

Journal Article

Journal of Combinatorial Optimization, ISSN 1382-6905, 10/2017, Volume 34, Issue 3, pp. 742 - 759

A graph G is said to be neighbor-sum-distinguishing edge k-choose if, for every list L of colors such that L(e...

Combinatorial Nullstellensatz | Convex and Discrete Geometry | Operations Research/Decision Theory | Subcubic graph | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | List neighbor-sum-distinguishing edge coloring | Maximum average degree | 05C15 | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | DISTINGUISHING INDEX | Business schools

Combinatorial Nullstellensatz | Convex and Discrete Geometry | Operations Research/Decision Theory | Subcubic graph | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Combinatorics | Optimization | List neighbor-sum-distinguishing edge coloring | Maximum average degree | 05C15 | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | DISTINGUISHING INDEX | Business schools

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 02/2018, Volume 38, Issue 1, pp. 107 - 119

In the paper, we show that the incidence chromatic number χ
of a complete
-partite graph is at most Δ + 2 (i.e...

(1,1)-labelling | complete multipartite graphs | 05C85 | semicubic graphs | incidence coloring | subcubic graphs | completeness | 05C69 | 05C05 | Subcubic graphs | Semicubic graphs | Complete multipartite graphs | L(1, 1)-labelling | Incidence coloring | NP-completeness | MATHEMATICS | NUMBER | L(1,1)-labelling | STAR ARBORICITY

(1,1)-labelling | complete multipartite graphs | 05C85 | semicubic graphs | incidence coloring | subcubic graphs | completeness | 05C69 | 05C05 | Subcubic graphs | Semicubic graphs | Complete multipartite graphs | L(1, 1)-labelling | Incidence coloring | NP-completeness | MATHEMATICS | NUMBER | L(1,1)-labelling | STAR ARBORICITY

Journal Article

Ars mathematica contemporanea, ISSN 1855-3966, 2016, Volume 10, Issue 2, pp. 359 - 370

An edge-coloring of a graph G is said to be odd if for each vertex v of G and each color c, the vertex v either uses the color c an odd number of times or does not use it at all...

T-join | Subcubic graph | Odd chromatic index | Odd edge-covering | Odd edge-coloring | MATHEMATICS | MATHEMATICS, APPLIED | odd edge-coloring | odd chromatic index | odd edge-covering

T-join | Subcubic graph | Odd chromatic index | Odd edge-covering | Odd edge-coloring | MATHEMATICS | MATHEMATICS, APPLIED | odd edge-coloring | odd chromatic index | odd edge-covering

Journal Article

IEICE transactions on information and systems, ISSN 0916-8532, 2015, Volume E98.D, Issue 8, pp. 1589 - 1591

...(n2log 6n) time for graphs with maximum degree at most 3 (subcubic graphs) by reducing it to the graphic matroid parity problem, where n is the number of vertices in a graph...

feedback vertex set | irreversible threshold process | graphic matroid parity problem | subcubic graphs | Subcubic graphs | Irreversible threshold process | Feedback vertex set | Graphic matroid parity problem | COMPUTER SCIENCE, SOFTWARE ENGINEERING | CONVERSION | COMPUTER SCIENCE, INFORMATION SYSTEMS

feedback vertex set | irreversible threshold process | graphic matroid parity problem | subcubic graphs | Subcubic graphs | Irreversible threshold process | Feedback vertex set | Graphic matroid parity problem | COMPUTER SCIENCE, SOFTWARE ENGINEERING | CONVERSION | COMPUTER SCIENCE, INFORMATION SYSTEMS

Journal Article

Mathematical programming, ISSN 1436-4646, 2012, Volume 138, Issue 1-2, pp. 43 - 82

A simple 2-matching in an edge-weighted graph is a subgraph all of whose nodes have degree 0, 1 or 2...

Theoretical, Mathematical and Computational Physics | Mathematics | 05C70 | 90C05 | 90C27 | 90C10 | Mathematical Methods in Physics | 2-Matchings | 90C57 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Subcubic graph | Traveling salesman problem | Combinatorics | Polyhedral characterization | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MAXIMUM | FREE 2-FACTORS | Management science | Algorithms | Polytopes | Mathematical analysis | Inequalities | Graphs | Hulls (structures) | Hulls | Vectors (mathematics)

Theoretical, Mathematical and Computational Physics | Mathematics | 05C70 | 90C05 | 90C27 | 90C10 | Mathematical Methods in Physics | 2-Matchings | 90C57 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Subcubic graph | Traveling salesman problem | Combinatorics | Polyhedral characterization | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MAXIMUM | FREE 2-FACTORS | Management science | Algorithms | Polytopes | Mathematical analysis | Inequalities | Graphs | Hulls (structures) | Hulls | Vectors (mathematics)

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 2020

Journal Article

Journal of Graph Theory, ISSN 0364-9024, 08/2018, Volume 88, Issue 4, pp. 566 - 576

.... A multigraph G is star k‐edge‐colorable if χs′(G)≤k. Dvořák, Mohar, and Šámal [Star chromatic index, J. Graph Theory 72 (2013), 313–326...

star edge‐coloring | maximum average degree | subcubic multigraphs | star edge-coloring | MATHEMATICS | GRAPHS

star edge‐coloring | maximum average degree | subcubic multigraphs | star edge-coloring | MATHEMATICS | GRAPHS

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 05/2013, Volume 33, Issue 2, pp. 373 - 385

A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color...

star coloring | subcubic graphs | vertex coloring | Star coloring | Subcubic graphs | Vertex coloring | MATHEMATICS | SPARSE HESSIAN MATRICES | ACYCLIC COLORINGS

star coloring | subcubic graphs | vertex coloring | Star coloring | Subcubic graphs | Vertex coloring | MATHEMATICS | SPARSE HESSIAN MATRICES | ACYCLIC COLORINGS

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 05/2013, Volume 33, Issue 2, pp. 373 - 385

A star coloring of an undirected graph G is a coloring of the vertices of G such that (i) no two adjacent vertices receive the same color...

star coloring | subcubic graphs | vertex coloring

star coloring | subcubic graphs | vertex coloring

Journal Article

No results were found for your search.

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