Ewa Drgas-Burchardt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ewa Drgas-Burchardt has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Agata Drzystek
University of Zielona Góra
3 shared publications - Elżbieta Sidorowicz
University of Zielona Góra
3 shared publications - Marta Borowiecka-Olszewska
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Zielona Gora, Poland
2 shared publications - Hanna Furmańczyk
Institute of Informatics Faculty of Mathematics Physics and Informatics University of Gdańsk Gdańsk Poland
1 shared publication - Izak Broere
Department of Mathematics and Applied Mathematics, University of Pretoria, South Africa
1 shared publication - Nahid Yelene Javier-Nol
Faculty of Science, National Autonomous University of Mexico, Mexico City, Mexico
1 shared publication
Latest Publications
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 46 (4) , 1211
Interval colouring thickness and the Erdős family of graphs
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 46 (4) , 1211
Interval colouring thickness and the Erdős family of graphs
- 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (3) , 1217-1241
Hypergraph operations preserving sc-greediness
- 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (3) , 1217-1241
Hypergraph operations preserving sc-greediness
- 21 February 2022
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 22 (1) , #P1.05
Sum-list-colouring of θ-hypergraphs
Sum-list-colouring of θ-hypergraphs
- 21 February 2022
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 22 (1) , #P1.05
Sum-list-colouring of θ-hypergraphs
Sum-list-colouring of θ-hypergraphs
- 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.
- 6 January 2021
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 49 (4) , 1333-1348
Acyclic Sum-List-Colouring of Cylinders
- 6 January 2021
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 49 (4) , 1333-1348
Acyclic Sum-List-Colouring of Cylinders
- Open Access
- 29 May 2020
- Published by Springer Nature
- Vol. 12126, 251-263
Equitable d-degenerate Choosability of Graphs
Let \(\mathcal{D}_d\) be the class of d-degenerate graphs and let L be a list assignment for a graph G. A colouring of G such that every vertex receives a colour from its list and the subgraph induced by vertices coloured with one color is a d-degenerate graph is called the \((L,\mathcal{D}_d)\)-colouring of G. For a k-uniform list assignment L and \(d\in \mathbb {N}_0\), a graph G is equitably \((L,\mathcal{D}_d)\)-colorable if there is an \((L,\mathcal{D}_d)\)-colouring of G such that the size of any colour class does not exceed \(\left\lceil |V(G)|/k\right\rceil \). An equitable \((L,\mathcal{D}_d)\)-colouring is a generalization of an equitable list coloring, introduced by Kostochka et al., and an equitable list arboricity presented by Zhang. Such a model can be useful in the network decomposition where some structural properties on subnets are imposed. In this paper we give a polynomial-time algorithm that for a given (k, d)-partition of G with a t-uniform list assignment L and \(t\ge k\), returns its equitable \((L,\mathcal {D}_{d-1})\)-colouring. In addition, we show that 3-dimensional grids are equitably \((L,\mathcal {D}_1)\)-colorable for any t-uniform list assignment L where \(t\ge 3\).- 29 May 2020
- Published by Springer Nature
- Vol. 12126, 251-263
Open AccessEquitable d-degenerate Choosability of Graphs
Let \(\mathcal{D}_d\) be the class of d-degenerate graphs and let L be a list assignment for a graph G. A colouring of G such that every vertex receives a colour from its list and the subgraph induced by vertices coloured with one color is a d-degenerate graph is called the \((L,\mathcal{D}_d)\)-colouring of G. For a k-uniform list assignment L and \(d\in \mathbb {N}_0\), a graph G is equitably \((L,\mathcal{D}_d)\)-colorable if there is an \((L,\mathcal{D}_d)\)-colouring of G such that the size of any colour class does not exceed \(\left\lceil |V(G)|/k\right\rceil \). An equitable \((L,\mathcal{D}_d)\)-colouring is a generalization of an equitable list coloring, introduced by Kostochka et al., and an equitable list arboricity presented by Zhang. Such a model can be useful in the network decomposition where some structural properties on subnets are imposed. In this paper we give a polynomial-time algorithm that for a given (k, d)-partition of G with a t-uniform list assignment L and \(t\ge k\), returns its equitable \((L,\mathcal {D}_{d-1})\)-colouring. In addition, we show that 3-dimensional grids are equitably \((L,\mathcal {D}_1)\)-colorable for any t-uniform list assignment L where \(t\ge 3\). - 1 August 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 267, 73-84
Improper sum-list colouring of 2-trees
- 1 August 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 267, 73-84
Improper sum-list colouring of 2-trees
- 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
- 15 November 2011
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 28 (2) , 267-280
Unique factorization of compositive hereditary graph properties
- 15 November 2011
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 28 (2) , 267-280
Unique factorization of compositive hereditary graph properties
- 13 April 2009
- Published by Wiley in Journal of Graph Theory
- Vol. 62 (1) , 48-64
On uniqueness of a general factorization of graph properties
A graph property is any class of simple graphs, which is closed under isomorphisms. Let H be a given graph on vertices v1, …, vn. For graph properties 𝒫1, …, 𝒫n, we denote by H[𝒫1, …, 𝒫n] the class of those (𝒫1, …, 𝒫n) ‐partitionable graphs G, with a corresponding vertex partition (V1, …, Vn), for which an edge {xi, xj} with xi∈Vi and xj∈Vj implies the existence of the edge {vi, vj} in the graph H. The problem of the unique description of a graph property 𝒫 in the form H[𝒫1, …, 𝒫n] is investigated for 𝒫, 𝒫1, …, 𝒫n being from the class La of all graph properties closed under taking disjoint unions and subgraphs. The unique factorization theorems obtained in the paper generalize known results of this type bringing together ∘ ‐reducibility over La and ∨ ‐reducibility in the lattice (La, ⊆). There is also offered a new insight into the modular decomposition tree for a graph. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 48–64, 2009
- 13 April 2009
- Published by Wiley in Journal of Graph Theory
- Vol. 62 (1) , 48-64
On uniqueness of a general factorization of graph properties
A graph property is any class of simple graphs, which is closed under isomorphisms. Let H be a given graph on vertices v1, …, vn. For graph properties 𝒫1, …, 𝒫n, we denote by H[𝒫1, …, 𝒫n] the class of those (𝒫1, …, 𝒫n) ‐partitionable graphs G, with a corresponding vertex partition (V1, …, Vn), for which an edge {xi, xj} with xi∈Vi and xj∈Vj implies the existence of the edge {vi, vj} in the graph H. The problem of the unique description of a graph property 𝒫 in the form H[𝒫1, …, 𝒫n] is investigated for 𝒫, 𝒫1, …, 𝒫n being from the class La of all graph properties closed under taking disjoint unions and subgraphs. The unique factorization theorems obtained in the paper generalize known results of this type bringing together ∘ ‐reducibility over La and ∨ ‐reducibility in the lattice (La, ⊆). There is also offered a new insight into the modular decomposition tree for a graph. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 48–64, 2009