Mieczyslaw Borowiecki - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2020

Graph classes generated by MycielskiansMieczyslaw Borowiecki, Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz. dmgt, 40(4):1163-1173, 2020. [doi]

Independent (k+1)-domination in k-treesMieczyslaw Borowiecki, Anna Fiedorowicz, Elzbieta Sidorowicz, Zsolt Tuza. DAM, 284:99-110, 2020. [doi]

2018

P-apex graphsMieczyslaw Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz. dmgt, 38(2):323-349, 2018. [doi]

2016

Hamiltonicity and generalised total colourings of planar graphsMieczyslaw Borowiecki, Izak Broere. dmgt, 36(2):243-257, 2016. [doi]

2014

A feedback vertex set of 2-degenerate graphsMieczyslaw Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz. TCS, 557:50-58, 2014. [doi]

2012

Q-Ramsey classes of graphsMieczyslaw Borowiecki, Anna Fiedorowicz. DM, 312(23):3437-3443, 2012. [doi]

Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphsMieczyslaw Borowiecki, Ewa Drgas-Burchardt. DM, 312(14):2146-2152, 2012. [doi]

Coloring chip configurations on graphs and digraphsMieczyslaw Borowiecki, Jaroslaw Grytczuk, Monika Pilsniak. ipl, 112(1-2):1-4, 2012. [doi]

2011

Partitions of GraphsMieczyslaw Borowiecki. In Matthias Dehmer, editor, Structural Analysis of Complex Networks. pages 27-47, Birkhäuser / Springer, 2011. [doi]

Generalized total colorings of graphsMieczyslaw Borowiecki, Arnfried Kemnitz, Massimiliano Marangio, Peter Mihók. dmgt, 31(2):209-222, 2011. [doi]

2010

Acyclic edge colouring of planar graphs without short cyclesMieczyslaw Borowiecki, Anna Fiedorowicz. DM, 310(9):1445-1455, 2010. [doi]

Acyclic colourings of graphs with bounded degreeMieczyslaw Borowiecki, Anna Fiedorowicz, Katarzyna Jesse-Józefczyk, Elzbieta Sidorowicz. dmtcs, 12(1):59-74, 2010. [doi]

2009

Acyclic reducible bounds for outerplanar graphsMieczyslaw Borowiecki, Anna Fiedorowicz, Mariusz Haluszczak. dmgt, 29(2):219-239, 2009. [doi]

2008

Matching cutsets in graphs of diameter 2Mieczyslaw Borowiecki, Katarzyna Jesse-Józefczyk. TCS, 407(1-3):574-582, 2008. [doi]

2007

On chromaticity of hypergraphsMieczyslaw Borowiecki, Ewa Lazuka. DM, 307(11-12):1418-1429, 2007. [doi]

Generalised game colouring of graphsMieczyslaw Borowiecki, Elzbieta Sidorowicz. DM, 307(11-12):1225-1231, 2007. [doi]

Game List Colouring of GraphsMieczyslaw Borowiecki, Elzbieta Sidorowicz, Zsolt Tuza. combinatorics, 14(1), 2007. [doi]

2006

List coloring of Cartesian products of graphsMieczyslaw Borowiecki, Stanislav Jendrol, Daniel Král, Jozef Miskuf. DM, 306(16):1955-1958, 2006. [doi]

On partitions of hereditary properties of graphsMieczyslaw Borowiecki, Anna Fiedorowicz. dmgt, 26(3):377-387, 2006. [doi]

PrefaceMieczyslaw Borowiecki. dmgt, 26(3):357, 2006. [doi]

2005

PrefaceMieczyslaw Borowiecki. dmgt, 25(1-2):5, 2005. [doi]

Ramsey (K1, 2, K3)-Minimal GraphsMieczyslaw Borowiecki, Ingo Schiermeyer, Elzbieta Sidorowicz. combinatorics, 12, 2005. [doi]

2004

On Ramsey minimal graphsMieczyslaw Borowiecki, Mariusz Haluszczak, Elzbieta Sidorowicz. DM, 286(1-2):37-43, 2004. [doi]

2003

Schütte s Tournament Problem and Intersecting Families of SetsMieczyslaw Borowiecki, Jaroslaw Grytczuk, Mariusz Haluszczak, Zsolt Tuza. cpc, 12(4):359-364, 2003.

2002

Some extremal problems of graphs with local constraintsMieczyslaw Borowiecki, Elzbieta Sidorowicz. DM, 251(1-3):19-32, 2002. [doi]

P-saturated graphsMieczyslaw Borowiecki, Elzbieta Sidorowicz. dmgt, 22(1):17-29, 2002. [doi]

2001

On graphs with a local hereditary propertyMieczyslaw Borowiecki, Peter Mihók. DM, 236(1-3):53-58, 2001. [doi]

2000

Minimal reducible bounds for 1-nonouterplanar graphsMieczyslaw Borowiecki, Mariusz Haluszczak, Miroslawa Skowronska. DM, 219(1-3):9-15, 2000. [doi]

Minimal reducible bounds for planar graphsMieczyslaw Borowiecki, Izak Broere, Peter Mihók. DM, 212(1-2):19-27, 2000. [doi]

Chromatic polynomials of hypergraphsMieczyslaw Borowiecki, Ewa Lazuka. dmgt, 20(2):293-301, 2000. [doi]

1999

Remarks on the existence of uniquely partitionable planar graphsMieczyslaw Borowiecki, Peter Mihók, Zsolt Tuza, Margit Voigt. dmgt, 19(2):159-166, 1999. [doi]

1998

Generalized independence and domination in graphsMieczyslaw Borowiecki, Danuta Michalak. DM, 191(1-3):51-56, 1998. [doi]

1997

A survey of hereditary properties of graphsMieczyslaw Borowiecki, Izak Broere, Marietjie Frick, Peter Mihók, Gabriel Semanisin. dmgt, 17(1):5-50, 1997. [doi]

Generalized domination, independence and irredudance in graphsMieczyslaw Borowiecki, Danuta Michalak, Elzbieta Sidorowicz. dmgt, 17(1):147-153, 1997. [doi]

On generalized list colourings of graphsMieczyslaw Borowiecki, Izak Broere, Peter Mihók. dmgt, 17(1):127-132, 1997. [doi]

1995

k-degenerate graphsMieczyslaw Borowiecki, Jaroslav Ivanco, Peter Mihók, Gabriel Semanisin. jgt, 19(1):117-124, 1995. [doi]

Generalized list colourings of graphsMieczyslaw Borowiecki, Ewa Drgas-Burchardt, Peter Mihók. dmgt, 15(2):185-193, 1995. [doi]

1993

Classes of chromatically unique graphsMieczyslaw Borowiecki, Ewa Drgas-Burchardt. DM, 111(1-3):71-75, 1993. [doi]

Classes of chromatically unique or equivalent graphsMieczyslaw Borowiecki, Ewa Drgas-Burchardt. DM, 121(1-3):11-18, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL