Displaying similar documents to “Decomposition tree and indecomposable coverings”

A note to independent sets in scheduling

Jan Černý (1995)

Applications of Mathematics

Similarity:

The paper studies the bus-journey graphs in the case when they are piecewise expanding and contracting (if described by fathers-sons relations starting with the greatest independent set of nodes). This approach can make it possible to solve the minimization problem of the total service time of crews.

On H-Irregularity Strength Of Graphs

Faraha Ashraf, Martin Bača, Marcela Lascśaková, Andrea Semaničová-Feňovčíková (2017)

Discussiones Mathematicae Graph Theory

Similarity:

New graph characteristic, the total H-irregularity strength of a graph, is introduced. Estimations on this parameter are obtained and for some families of graphs the precise values of this parameter are proved.