All Research Papers Published In Electronic Notes in Discrete Mathematics

Research Article
13
10.1016/j.endm.2017.06.055

Pebble Games and Cospectral Graphs

Aug 01, 2017
Electronic Notes in Discrete Mathematics
Anuj Dawar + 2 more +2

Research Article
4
10.1016/j.endm.2017.07.067

Spectral Bisection with Two Eigenvectors

Aug 01, 2017
Electronic Notes in Discrete Mathematics
Israel Rocha

Research Article
17
10.1016/j.endm.2017.06.065

A note on the maximum number of triangles in a C5-free graph

Aug 01, 2017
Electronic Notes in Discrete Mathematics
Beka Ergemlidze + 3 more +3

Research Article
1
10.1016/j.endm.2017.06.053

Contracting Bipartite Graphs to Paths and Cycles

Aug 01, 2017
Electronic Notes in Discrete Mathematics
Konrad K Dabrowski + 1 more +1

Testing if a given graph G contains the k-vertex path Pk as a minor or as an induced minor is trivial for every fixed integer k≥1. The situation changes for the problem of checking if a graph can be modified into Pk by using only edge contractions. In this case the problem is known to be NP-complete even if k=4. This led to an intensive investigation for testing contractibility on restricted graph classes. We focus on bipartite graphs. Heggernes, van 't Hof, Lévêque and Paul proved that the problem stays NP-complete for bipartite graphs if k=6. We strengthen their result from k=6 to k=5. We also show that the problem of contracting a bipartite graph to the 6-vertex cycle C6 is NP-complete. The cyclicity of a graph is the length of the longest cycle the graph can be contracted to. As a consequence of our second result, determining the cyclicity of a bipartite graph is NP-hard.

Research Article
10.1016/j.endm.2017.06.056

On avoding r-repetitions in [formula omitted

Aug 01, 2017
Electronic Notes in Discrete Mathematics
Michal Dębski + 7 more +7

Research Article
2
10.1016/j.endm.2017.07.030

Finding strongly popular b-matchings in bipartite graphs

Aug 01, 2017
Electronic Notes in Discrete Mathematics
Tamás Király + 1 more +1

Research Article
36
10.1016/j.endm.2017.07.058

Modularity in several random graph models

Aug 01, 2017
Electronic Notes in Discrete Mathematics
Liudmila Ostroumova Prokhorenkova + 2 more +2

Research Article
3
10.1016/j.endm.2017.06.038

Packing two graphs of even girth 10

Aug 01, 2017
Electronic Notes in Discrete Mathematics
Wouter Cames Van Batenburg + 1 more +1

Research Article
1
10.1016/j.endm.2017.06.003

On λ-fold Rosa-type Labelings of Bipartite Multigraphs

Jun 29, 2017
Electronic Notes in Discrete Mathematics
R.c Bunge + 4 more +4

Research Article
3
10.1016/j.endm.2017.05.013

Periodic parallelogram polyominoes

Jun 01, 2017
Electronic Notes in Discrete Mathematics
Adrien Boussicault + 1 more +1