X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (57) 57
subcubic graphs (51) 51
subcubic graph (45) 45
graphs (37) 37
mathematics, applied (37) 37
graph theory (20) 20
algorithms (19) 19
mathematical analysis (14) 14
computer science (12) 12
maximum average degree (12) 12
graph coloring (10) 10
planar graphs (10) 10
combinatorics (9) 9
color (8) 8
coloring (8) 8
colorings (7) 7
computer science, information systems (7) 7
computer science, theory & methods (7) 7
cubic graphs (7) 7
discrete mathematics and combinatorics (7) 7
integers (7) 7
planar graph (7) 7
strong chromatic index (7) 7
bipartite density (6) 6
discrete mathematics (6) 6
optimization (6) 6
subcubic (6) 6
approximation algorithm (5) 5
bipartite graphs (5) 5
bounds (5) 5
chromatic number (5) 5
computer science, software engineering (5) 5
free subcubic graphs (5) 5
graph (5) 5
mathematics - combinatorics (5) 5
number (5) 5
upper bounds (5) 5
05c15 (4) 4
acyclic edge coloring (4) 4
apexes (4) 4
combinatorial nullstellensatz (4) 4
computer science, interdisciplinary applications (4) 4
convex and discrete geometry (4) 4
edge coloring (4) 4
engineering design (4) 4
equitable coloring (4) 4
lower bounds (4) 4
mathematical modeling and industrial mathematics (4) 4
operations research/decision theory (4) 4
partitions (4) 4
star arboricity (4) 4
studies (4) 4
subgraphs (4) 4
theoretical computer science (4) 4
theory of computation (4) 4
vertex coloring (4) 4
05c70 (3) 3
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (3) 3
acyclic coloring (3) 3
acyclic colouring (3) 3
applied mathematics (3) 3
approximation algorithms (3) 3
bipartite graph (3) 3
bipartite subgraphs (3) 3
circulations (3) 3
colour (3) 3
colouring (3) 3
combinatorial analysis (3) 3
density (3) 3
distinguishing index (3) 3
equivalences (3) 3
even factors (3) 3
forests (3) 3
girth (3) 3
graph algorithms (3) 3
graph matching (3) 3
induced matchings (3) 3
integrality gap (3) 3
k-partitions (3) 3
management science (3) 3
mathematics, general (3) 3
max-cut (3) 3
maximum degree (3) 3
minimum 2-edge-connected subgraph problem (3) 3
packing coloring (3) 3
square (3) 3
strong edge-coloring (3) 3
t-matchings (3) 3
triangle-free (3) 3
uniquely restricted matching (3) 3
05c69 (2) 2
2-distance coloring (2) 2
2-distance vertex-distinguishing index (2) 2
[ info ] computer science [cs] (2) 2
acyclic colorings (2) 2
all-pairs shortest paths (2) 2
analysis (2) 2
approximation (2) 2
augmenting graph (2) 2
bisections (2) 2
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


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
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
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
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
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
Journal Article
Journal of combinatorial optimization, ISSN 1573-2886, 2018, Volume 36, Issue 4, pp. 1425 - 1438
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
Journal Article
Rocznik Akademii Górniczo-Hutniczej im. Stanisława Staszica. Opuscula Mathematica, ISSN 1232-9274, 2018, Volume 38, Issue 6, pp. 795 - 817
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
Journal Article
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
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
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 02/2018, Volume 38, Issue 1, pp. 107 - 119
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
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
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
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
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
Journal Article
No results were found for your search.

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