X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science (19) 19
discrete mathematics (18) 18
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (9) 9
maximum average degree (9) 9
graph coloring (8) 8
mathematics, applied (8) 8
graphs (7) 7
combinatorics (6) 6
color (5) 5
mathematics (5) 5
planar graphs (5) 5
astrophysics (4) 4
coloring (4) 4
cosmology and extragalactic astrophysics (4) 4
galaxy astrophysics (4) 4
graph theory (4) 4
mathematics - combinatorics (4) 4
subcubic graphs (4) 4
colour (3) 3
computer science, information systems (3) 3
discharging method (3) 3
forbidden cycles (3) 3
mathematical analysis (3) 3
strong chromatic index (3) 3
strong edge-colouring (3) 3
studies (3) 3
upper bounds (3) 3
acyclic choosability (2) 2
acyclic coloring (2) 2
apexes (2) 2
applied mathematics (2) 2
combinatorial problems (2) 2
discrete mathematics and combinatorics (2) 2
np-completeness (2) 2
optimization (2) 2
strong edge colouring (2) 2
trees (2) 2
05c15 (1) 1
05c78 (1) 1
[ math.math-co ] mathematics [math]/combinatorics [math.co] (1) 1
adjacent vertex-distinguishing edge coloring (1) 1
analyse combinatoire actes de congrès (1) 1
angioarchitecture (1) 1
anomalies (1) 1
análisis combinatorio (1) 1
applied mathematics. quantitative methods (1) 1
bounded degree graphs (1) 1
brain (1) 1
case-control (1) 1
cavernoma (1) 1
cavernous malformation (1) 1
chronic inflammation (1) 1
coloring game (1) 1
colorings (1) 1
colouring (1) 1
combinatorial analysis (1) 1
combinatorial analysis -- congresses (1) 1
combinatorial analysis congresses (1) 1
combinatoriek (1) 1
comorbidity (1) 1
complexity (1) 1
computational complexity (1) 1
computer science - discrete mathematics (1) 1
computer science, interdisciplinary applications (1) 1
congresses (1) 1
convex and discrete geometry (1) 1
cycles (1) 1
data entry (1) 1
data processing (1) 1
decision trees (1) 1
developmental venous anomaly (1) 1
disease (1) 1
distinguishing edge colorings (1) 1
documents (1) 1
edge coloring (1) 1
edge-weightings (1) 1
electronic books (1) 1
engineering design (1) 1
every planar graph (1) 1
forests (1) 1
game chromatic number (1) 1
game coloring number (1) 1
general (1) 1
girth (1) 1
grafentheorie (1) 1
graph theory -- congresses (1) 1
graph theory congresses (1) 1
graphes, théorie des actes de congrès (1) 1
graphic methods (1) 1
images (1) 1
incidence (1) 1
incidence chromatic number (1) 1
incidence coloring (1) 1
increased prevalence (1) 1
induced matching (1) 1
inflammation (1) 1
irregular chromatic index (1) 1
irregularity strength (1) 1
leaves (1) 1
lists (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Applied Mathematics, ISSN 0166-218X, 12/2019, Volume 271, pp. 64 - 73
A proper vertex k-coloring of a graph G=(V,E) is an assignment c:V→{1,2,…,k} of colors to the vertices of the graph such that no two adjacent vertices are... 
Graph coloring | Discharging method | Square coloring | Maximum average degree | MATHEMATICS, APPLIED | Coloring | Graphs | Graph theory | Decision trees | Apexes
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 11/2017, Volume 33, Issue 6, pp. 1459 - 1471
A proper edge k-colouring of a graph $$G=(V,E)$$ G = ( V , E ) is an assignment $$c:E\rightarrow \{1,2,\ldots ,k\}$$ c : E → { 1 , 2 , … , k } of colours to... 
05C78 | Neighbour sum distinguishing index | Mathematics | Engineering Design | Discharging method | Combinatorics | Maximum average degree | 05C15 | MATHEMATICS | IRREGULARITY STRENGTH | DISTINGUISHING EDGE COLORINGS | Mathematics - Combinatorics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 11/2019, Volume 270, pp. 13 - 24
Neighbour-sum-distinguishing edge-weightings are a way to “encode” proper vertex-colourings via the sums of weights incident to the vertices. Over the last... 
Number of sums | Neighbour-sum-distinguishing edge-weightings | Neighbour-sum-distinguishing | edge-weightings | MATHEMATICS, APPLIED | COMPLEXITY | Trees (mathematics) | Graph theory | Graph coloring | Apexes | Upper bounds | Sums | Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2014, Volume 179, pp. 229 - 234
A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum... 
Proper edge-colouring | Strong edge-colouring | Girth | Planar graphs | MATHEMATICS, APPLIED | STRONG CHROMATIC INDEX | MAXIMUM DEGREE-7 | Computer Science | Discrete Mathematics
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 7/2013, Volume 26, Issue 1, pp. 152 - 160
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 11/2015, Volume 49, pp. 773 - 778
A strong edge coloring of a graph is a proper edge coloring such that no edge has two incident edges of the same color. Erdős and Nešetřil conjectured in 1989... 
maximum average degree | strong chromatic index | strong edge coloring | discharging method | Discharging method | Strong chromatic index | Strong edge coloring | Maximum average degree | Mathematics | Combinatorics | Computer Science | Discrete Mathematics
Journal Article
Information Processing Letters, ISSN 0020-0190, 09/2013, Volume 113, Issue 19-21, pp. 836 - 843
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of three edges uses three colours. An induced matching of a graph G is a... 
Strong edge-colouring | Outerplanar graphs | Induced matching | Computational complexity | Planar graphs | COMPUTER SCIENCE, INFORMATION SYSTEMS | GRAPHS | Matching | Data processing | Graphs | Upper bounds | Color | Colour | Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2011, Volume 159, Issue 15, pp. 1650 - 1657
A strong edge colouring of a graph G is a proper edge colouring such that every path of length 3 uses three colours. In this paper, we prove that every... 
Subcubic graphs | Strong edge colouring | Maximum average degree | MATHEMATICS, APPLIED | Graphs | Colouring | Mathematical analysis | Color | Images | Colour | Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 11/2013, Volume 161, Issue 16-17, pp. 2467 - 2479
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of length 3 uses three different colours. In this paper we improve some... 
Subcubic graphs | Strong edge-colouring | Planar graphs | Maximum average degree | MATHEMATICS, APPLIED | STRONG CHROMATIC INDEX | NETWORKS | Graphs | Upper bounds | Mathematical analysis | Optimization | Color | Colour | Computer Science | Discrete Mathematics
Journal Article
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. A locally irregular decomposition of G is a partition E1,...,Ek of... 
Subcubic graphs | Locally irregular edge-colouring | Irregular chromatic index | Computer Science | Discrete Mathematics | irregular chromatic index | locally irregular edge-colouring | subcubic graphs
Journal Article
Information Processing Letters, ISSN 0020-0190, 2011, Volume 111, Issue 15, pp. 748 - 753
An acyclic k-coloring of a graph G is a proper vertex coloring of G, which uses at most k colors, such that the graph induced by the union of every two color... 
Combinatorial problems | Graph coloring | Acyclic coloring | Bounded degree graphs | COLORINGS | COMPUTER SCIENCE, INFORMATION SYSTEMS | EVERY PLANAR GRAPH | Coloring | Trees | Leaves | Graphs | Forests | Unions | Computer Science | Discrete Mathematics
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 2019
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2017, Volume 227, pp. 29 - 43
An incidence of an undirected graph G is a pair (v,e) where v is a vertex of G and e an edge of G incident with v. Two incidences (v,e) and (w,f) are adjacent... 
Graph coloring | Incidence chromatic number | Incidence coloring | Maximum average degree | MATHEMATICS, APPLIED | STAR ARBORICITY
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 12/2011, Volume 38, pp. 457 - 462
An adjacent vertex-distinguishing edge coloring, or avd-coloring, of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meets the... 
edge coloring | maximum average degree | vertex-distinguishing edge coloring | Vertex-distinguishing edge coloring | Edge coloring | Maximum average degree | Computer Science | Discrete Mathematics
Journal Article
Discrete Mathematics and Theoretical Computer Science, ISSN 1462-7264, 04/2019, Volume 21, Issue 1
How can one distinguish the adjacent vertices of a graph through an edge-weighting? In the last decades, this question has been attracting increasing... 
Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2010, Volume 158, Issue 10, pp. 1104 - 1110
An acyclic coloring of a graph G is a coloring of its vertices such that: (i) no two adjacent vertices in G receive the same color and (ii) no bicolored cycles... 
Forbidden cycles | Acyclic coloring | Sparse triangles | MATHEMATICS, APPLIED | CYCLES | Coloring | Lists | Mathematical analysis | Triangles | Color | Documents | Graphs | Computer Science | Discrete Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2020
The graph coloring game is a two-player game in which, given a graph G and a set of k colors, the two players, Alice and Bob, take turns coloring properly an... 
Mathematics | Combinatorics | Computer Science | Discrete Mathematics
Journal Article
Information Processing Letters, ISSN 0020-0190, 2009, Volume 109, Issue 21, pp. 1193 - 1196
An acyclic coloring of a graph G is a coloring of its vertices such that: (i) no two adjacent vertices in G receive the same color and (ii) no bicolored cycles... 
Forbidden cycles | Combinatorial problems | Acyclic choosability | Planar graphs | COMPUTER SCIENCE, INFORMATION SYSTEMS | Computer Science | Discrete Mathematics
Journal Article
03/2018
A proper total $k$-colouring of a graph $G=(V,E)$ is an assignment $c : V \cup E\to \{1,2,\ldots,k\}$ of colours to the edges and the vertices of $G$ such that... 
Mathematics - Combinatorics
Journal Article
Information Processing Letters, ISSN 0020-0190, 08/2011, Volume 111, Issue 15, p. 748
An acyclic k-coloring of a graph G is a proper vertex coloring of G, which uses at most k colors, such that the graph induced by the union of every two color... 
Studies | Graph coloring | Graph theory
Journal Article
No results were found for your search.

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