Marta Borowiecka-Olszewska
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Marta Borowiecka-Olszewska has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Ewa Drgas-Burchardt
5 shared publications- Ewa Drgas-Burchardt
University of Zielona Góra
2 shared publications Mariusz Hałuszczak
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra
2 shared publicationsB.H. Jasiulis-Gołdyn
1 shared publication- G. Mazurkiewicz
Uniwersytet Zielonogórski
1 shared publication J.K. Misiewicz
1 shared publication
Latest Publications
- 6 September 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 360, 65-80
On interval colouring reorientation number of oriented graphs
- 6 September 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 360, 65-80
On interval colouring reorientation number of oriented graphs
- 21 June 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (11)
Interval colourable orientations of graphs
- 21 June 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (11)
Interval colourable orientations of graphs
- Open Access
- 14 September 2021
- Published by Springer Nature in Results in Mathematics
- Vol. 76 (4) , 1-21
Consecutive Colouring of Oriented Graphs
We consider arc colourings of oriented graphs such that for each vertex the colours of all out-arcs incident with the vertex and the colours of all in-arcs incident with the vertex form intervals. We prove that the existence of such a colouring is an NP-complete problem. We give the solution of the problem for r-regular oriented graphs, transitive tournaments, oriented graphs with small maximum degree, oriented graphs with small order and some other classes of oriented graphs. We state the conjecture that for each graph there exists a consecutive colourable orientation and confirm the conjecture for complete graphs, 2-degenerate graphs, planar graphs with girth at least 8, and bipartite graphs with arboricity at most two that include all planar bipartite graphs. Additionally, we prove that the conjecture is true for all perfect consecutively colourable graphs and for all forbidden graphs for the class of perfect consecutively colourable graphs.
- 14 September 2021
- Published by Springer Nature in Results in Mathematics
- Vol. 76 (4) , 1-21
Open AccessConsecutive Colouring of Oriented Graphs
We consider arc colourings of oriented graphs such that for each vertex the colours of all out-arcs incident with the vertex and the colours of all in-arcs incident with the vertex form intervals. We prove that the existence of such a colouring is an NP-complete problem. We give the solution of the problem for r-regular oriented graphs, transitive tournaments, oriented graphs with small maximum degree, oriented graphs with small order and some other classes of oriented graphs. We state the conjecture that for each graph there exists a consecutive colourable orientation and confirm the conjecture for complete graphs, 2-degenerate graphs, planar graphs with girth at least 8, and bipartite graphs with arboricity at most two that include all planar bipartite graphs. Additionally, we prove that the conjecture is true for all perfect consecutively colourable graphs and for all forbidden graphs for the class of perfect consecutively colourable graphs.
- 1 January 2017
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 37 (2) , 315
Forbidden structures for planar perfect consecutively colourable graphs
Discussiones Mathematicae Graph Theory
- 1 January 2017
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 37 (2) , 315
Forbidden structures for planar perfect consecutively colourable graphs
Discussiones Mathematicae Graph Theory
- 1 July 2016
- Published by Elsevier in Discrete Mathematics
- Vol. 339 (7) , 1892-1908
The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
- 1 July 2016
- Published by Elsevier in Discrete Mathematics
- Vol. 339 (7) , 1892-1908
The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
- 1 March 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 201, 24-37
On the structure and deficiency of k-trees with bounded degree
- 1 March 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 201, 24-37
On the structure and deficiency of k-trees with bounded degree
- Open Access
- 1 November 2015
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 21 (4) , 2513-2551
Lévy processes and stochastic integrals in the sense of generalized convolutions
Project Euclid - mathematics and statistics online
- 1 November 2015
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 21 (4) , 2513-2551
Open AccessLévy processes and stochastic integrals in the sense of generalized convolutions
Project Euclid - mathematics and statistics online
- 1 October 2013
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (19) , 1843-1855
On Ramsey-minimal graphs- 1 October 2013
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (19) , 1843-1855
On Ramsey-minimal graphs- 6 September 2004
- Published by Elsevier in Discrete Mathematics
- Vol. 286 (1-2) , 31-36
Minimal vertex Ramsey graphs and minimal forbidden subgraphs
- 6 September 2004
- Published by Elsevier in Discrete Mathematics
- Vol. 286 (1-2) , 31-36
Minimal vertex Ramsey graphs and minimal forbidden subgraphs
- 1 June 2004
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 121 (5) , 2674-2680
The Arithmetic of Convolutions, Scale Mixtures, and Convolution Mixtures
- 1 June 2004
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 121 (5) , 2674-2680
The Arithmetic of Convolutions, Scale Mixtures, and Convolution Mixtures