|
|
Partitioning powers of traceable or hamiltonian graphs
Olivier Baudon
,
Julien Bensmail
,
Jakub Przybylo
,
Mariusz Woźniak
Journal articles
hal-00919048v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Ore and Erdős type conditions for long cycles in balanced bipartite graphs
Janusz Adamus
,
Lech Adamus
Discrete Mathematics and Theoretical Computer Science, 2009, Vol. 11 no. 2 (2), pp.57--69. ⟨10.46298/dmtcs.459⟩
Journal articles
hal-00988209v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Neighbor Sum Distinguishing Index
Evelyne Flandrin
,
Antoni Marczyk
,
Jakub Przybylo
,
Jean-François Saclé
,
Mariusz Woźniak
et al.
Journal articles
hal-01753341v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
A note on neighbor expanded sum distinguishing index
Hao Li
,
Evelyne Flandrin
,
Antoni Marczyk
,
Jean-François Saclé
,
Mariusz Woźniak
et al.
Journal articles
hal-01725813v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Minimum Size Tree-decompositions
Bi Li
,
Fatima Zahra Moataz
,
Nicolas Nisse
,
Karol Suchan
LAGOS 2015 – VIII Latin-American Algorithms, Graphs and Optimization Symposium, May 2015, Beberibe, Ceará, Brazil
Conference papers
hal-01162695v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs
Shonda Gosselin
,
Andrzej Szymański
,
Adam Pawel Wojda
Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 2 (2), pp.215--222. ⟨10.46298/dmtcs.604⟩
Journal articles
hal-00980768v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph
Olivier Baudon
,
Julien Bensmail
,
Rafał Kalinowski
,
Antoni Marczyk
,
Jakub Przybyło
et al.
Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.225--232. ⟨10.46298/dmtcs.1259⟩
Journal articles
hal-01179212v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Size-Constrained Tree Decompositions
Bi Li
,
Fatima Zahra Moataz
,
Nicolas Nisse
,
Karol Suchan
[Research Report] INRIA Sophia-Antipolis. 2014
Reports
hal-01074177v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On the Cartesian product of an arbitrarily partitionable graph and a traceable graph
Olivier Baudon
,
Julien Bensmail
,
Rafal Kalinowski
,
Antoni Marczyk
,
Jakub Przybylo
et al.
Discrete Mathematics and Theoretical Computer Science, 2014, 16 (2), pp.225-232
Journal articles
hal-00756971v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Recursively Arbitrarily Vertex Decomposable Suns
Olivier Baudon
,
Frédéric Gilbert
,
Mariusz Woźniak
2010
Preprints, Working Papers, ...
hal-00512578v2
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Recursively arbitrarily vertex-decomposable graphs
Olivier Baudon
,
Frédéric Gilbert
,
Mariusz Woźniak
Journal articles
hal-00918939v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Complexity of splits reconstruction for low-degree trees
Serge Gaspers
,
Mathieu Liedloff
,
Maya Stein
,
Karol Suchan
Journal articles
hal-01105095v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Recurrence among trees with most numerous efficient dominating sets
Dorota Bród
,
Zdzisław Skupień
Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.43--55. ⟨10.46298/dmtcs.445⟩
Journal articles
hal-00972308v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On the Meyniel condition for hamiltonicity in bipartite digraphs
Janusz Adamus
,
Lech Adamus
,
Anders Yeo
Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.293--302. ⟨10.46298/dmtcs.1264⟩
Journal articles
hal-01179219v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
On neighbour-distinguishing colourings from lists
Mirko Horňák
,
Mariusz Woźniak
Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 2 (2), pp.21--28. ⟨10.46298/dmtcs.577⟩
Journal articles
hal-00990586v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Self-complementing permutations of k-uniform hypergraphs
Artur Szymański
,
Adam Pawel Wojda
Discrete Mathematics and Theoretical Computer Science, 2009, Vol. 11 no. 1 (1), pp.117--123. ⟨10.46298/dmtcs.468⟩
Journal articles
hal-00988180v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
Adrian Kosowski
,
Bi Li
,
Nicolas Nisse
,
Karol Suchan
Algorithmica, 2015, 72 (3), pp.758-777
Journal articles
hal-01163494v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|
|
|
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Florent Becker
,
Adrian Kosowski
,
Martin Matamala
,
Nicolas Nisse
,
Ivan Rapaport
et al.
Journal articles
hal-01163186v1
|
Share
Gmail
Facebook
Twitter
LinkedIn
More
|