Linearly bounded infinite graphs

As a new attempt in this direction, our initial motivation for this paper was to design a quasi linear-time algorithm for Maximum Matching on distance-hereditary graphs and some

Korpelainen, Lozin, and Mayhill [Split permutation graphs, Graphs and Combinatorics, 30(3):633–646, 2014] proved that there exist split graphs with Dilworth number 2 with

In the following proposition, the primitive hole number of a complete graph

Defining suitable induced set-labels for the signed graphs obtained by finite number of edge contractions and verifying the balance and clusterability of these reduced signed

To assess the representativity of the standardized ECE 15 and extra-urban (EUDC) driving cycles, emis- sion levels measured for these cycles were compared to the assessed level of

An early memory is a statement of something that happened once, a specific incident, such as "I recall once when my brothers and I were at the beach " (Mosak, 1958, p.

● Le sujet peut être placé avant ou après le verbe.. Exemple : Hugo vient en vacances

This deliverable provides a technical summary of the different studies that contribute to the holis- tic design flow of CONTINUUM: energy consumption optimization through