Mieczysław Borowiecki

From MaRDI portal
Person:237417

Available identifiers

zbMath Open borowiecki.mieczyslawMaRDI QIDQ237417

List of research outcomes





PublicationDate of PublicationType
Connected domination game2022-02-10Paper
Graph classes generated by Mycielskians2020-08-26Paper
Independent \((k + 1)\)-domination in \(k\)-trees2020-07-07Paper
Colourings of (k-r,k)-trees2018-10-23Paper
\(\mathcal{P}\)-apex graphs2018-03-23Paper
Acyclic colorings of graphs with bounded degree2016-09-08Paper
A feedback vertex set of 2-degenerate graphs2016-06-27Paper
Hamiltonicity and generalised total colourings of planar graphs2016-04-25Paper
\(\mathcal Q\)-Ramsey classes of graphs2012-11-15Paper
Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs2012-07-04Paper
Coloring chip configurations on graphs and digraphs2012-03-09Paper
Generalized total colorings of graphs2011-08-24Paper
The complexity of some acyclic improper colourings2011-05-06Paper
On extremal sizes of locally k-tree graphs2011-02-11Paper
Partitions of Graphs2010-12-21Paper
Acyclic colorings of graphs with bounded degree2010-07-27Paper
Acyclic reducible bounds for outerplanar graphs2010-05-14Paper
Acyclic edge colouring of planar graphs without short cycles2010-05-05Paper
Matching cutsets in graphs of diameter 22008-11-18Paper
On partitions of hereditary properties of graphs2008-01-18Paper
Generalised game colouring of graphs2007-04-26Paper
On chromaticity of hypergraphs2007-04-26Paper
Game list colouring of graphs2007-03-23Paper
List coloring of Cartesian products of graphs2006-09-14Paper
Memory of Kazimierz Głazek2006-07-14Paper
Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs2005-11-01Paper
On Ramsey minimal graphs2004-10-01Paper
Schttes Tournament Problem and Intersecting Families of Sets2004-05-18Paper
Weakly P-saturated graphs2003-01-08Paper
On graphs with a local hereditary property2002-10-24Paper
Some extremal problems of graphs with local constraints2002-08-29Paper
Chromatic polynomials of hypergraphs2002-02-17Paper
Minimal reducible bounds for 1-nonouterplanar graphs2001-05-28Paper
Remarks on the existence of uniquely partitionable planar graphs2001-04-09Paper
Generalized independence and domination in graphs2000-11-02Paper
Minimal reducible bounds for planar graphs2000-03-21Paper
Generalized domination, independence and irredudance in graphs1998-12-29Paper
A survey of hereditary properties of graphs1998-12-02Paper
On generalized list colourings of graphs1998-11-08Paper
Generalized list colourings of graphs1996-08-20Paper
Sequences realizable by maximal k‐degenerate graphs1995-02-01Paper
https://portal.mardi4nfdi.de/entity/Q42937721994-07-07Paper
Classes of chromatically unique graphs1994-01-04Paper
Classes of chromatically unique or equivalent graphs1993-12-20Paper
https://portal.mardi4nfdi.de/entity/Q40271491993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q47108391992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39721021992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34705041989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30322751989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32113261989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52022181987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37840941987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37841051987-01-01Paper
Partition numbers, connectivity and Hamiltonicity1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30337841986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37039241985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37261631985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37641751985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37811411985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37261621985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37261611985-01-01Paper
Point partition numbers and generalized Nordhaus-Gaddum problems1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30393931983-01-01Paper
A characterization of middle graphs and a matroid associated with middle graphs of hypergraphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30374601983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36761661983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36598161982-01-01Paper
COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39046431981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39212551981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39330231980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39367771980-01-01Paper
On Hallian digraphs, permanents and transversals1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38598041979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38742381977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41827991977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41116111976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32069741976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41116121976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38875041976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41116101976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41205961976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40919961975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32086731975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32052811975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44019811973-01-01Paper
On chromatic number of products of two graphs1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56638971972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56638981972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56688321972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56483851970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56615431970-01-01Paper

Research outcomes over time

This page was built for person: Mieczysław Borowiecki