Publication | Date of Publication | Type |
---|
Edge-removing games on graphs | 2024-04-02 | Paper |
The 4-choosability of planar graphs and cycle adjacency | 2021-09-06 | Paper |
A short derivation for Turán numbers of paths | 2018-10-25 | Paper |
On the precise value of the strong chromatic index of a planar graph with a large girth | 2018-09-06 | Paper |
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model | 2018-06-12 | Paper |
Total Weight Choosability of Trees | 2017-05-24 | Paper |
Edge Roman domination on graphs | 2016-11-29 | Paper |
Max-coloring of vertex-weighted graphs | 2016-03-02 | Paper |
On the \({k}\)-power domination of hypergraphs | 2015-11-03 | Paper |
Strong edge-coloring for jellyfish graphs | 2015-08-05 | Paper |
From edge-coloring to strong edge-coloring | 2015-04-22 | Paper |
The number of steps and the final configuration of relaxation procedures on graphs | 2014-12-05 | Paper |
Strong chromatic index of planar graphs with large girth | 2014-11-18 | Paper |
On the algorithmic complexity of \(k\)-tuple total domination | 2014-08-22 | Paper |
Graphs with small balanced decomposition numbers | 2014-07-11 | Paper |
The linear guessing number of undirected graphs | 2014-04-29 | Paper |
Rainbow domination and related problems on strongly chordal graphs | 2014-04-16 | Paper |
Algorithmic aspects of the \(k\)-domination problem in graphs | 2014-04-16 | Paper |
\(b\)-chromatic numbers of powers of paths and cycles | 2014-04-10 | Paper |
Counterexamples to an edge spread question for zero forcing number | 2014-04-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5403041 | 2014-03-25 | Paper |
Dot product dimensions of graphs | 2014-02-18 | Paper |
On a conjecture on the balanced decomposition number | 2014-01-20 | Paper |
Roman domination on strongly chordal graphs | 2013-12-02 | Paper |
Strong Chromatic Index of 2-Degenerate Graphs | 2013-05-21 | Paper |
A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs | 2013-05-13 | Paper |
\(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture | 2013-04-25 | Paper |
On the mixed domination problem in graphs | 2013-04-17 | Paper |
Parity and strong parity edge-colorings of graphs | 2013-01-03 | Paper |
A short proof for Chen's alternative Kneser coloring lemma | 2012-11-09 | Paper |
Competition numbers of complete \(r\)-partite graphs | 2012-10-26 | Paper |
Roman Domination on 2-Connected Graphs | 2012-08-22 | Paper |
Generalized power domination of graphs | 2012-08-14 | Paper |
Hamiltonian numbers of Möbius double loop networks | 2012-07-17 | Paper |
The competition number of a graph with exactly two holes | 2012-07-10 | Paper |
(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles | 2012-07-04 | Paper |
First-fit chromatic numbers of \(d\)-degenerate graphs | 2012-06-18 | Paper |
Balanced \(k\)-decompositions of graphs | 2012-06-18 | Paper |
A characterization of graphs with rank 5 | 2012-05-11 | Paper |
Resource-sharing systems and hypergraph colorings | 2012-04-04 | Paper |
Strong edge-coloring for cubic Halin graphs | 2012-03-29 | Paper |
On the total choosability of planar graphs and of sparse graphs | 2012-03-27 | Paper |
Equitable colorings of Cartesian products of graphs | 2012-03-19 | Paper |
Upper bounds on Roman domination numbers of graphs | 2012-03-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q3114991 | 2012-02-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q3115034 | 2012-02-20 | Paper |
Near-automorphisms of paths | 2011-12-20 | Paper |
The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs | 2011-12-19 | Paper |
Vertex-coloring edge-weightings of graphs | 2011-12-01 | Paper |
Consecutive Edge-Colorings of Generalized θ-Graphs | 2011-11-11 | Paper |
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable | 2011-05-17 | Paper |
A characterization of graphs with rank 4 | 2011-03-17 | Paper |
The degree-preserving spanning tree problem in strongly chordal and directed path graphs | 2010-11-24 | Paper |
Equitable colorings of Kronecker products of graphs | 2010-11-05 | Paper |
A note on universally optimal matrices and field independence of the minimum rank of a graph | 2010-06-22 | Paper |
Finding cycles in hierarchical hypercube networks | 2010-06-09 | Paper |
Rainbow domination on trees | 2010-05-05 | Paper |
On minimum rank and zero forcing sets of a graph | 2010-04-29 | Paper |
On fully orientability of 2-degenerate graphs | 2010-03-24 | Paper |
Independent arcs of acyclic orientations of complete \(r\)-partite graphs | 2009-12-10 | Paper |
Isometric-path numbers of block graphs | 2009-08-27 | Paper |
On the profile of the corona of two graphs | 2009-07-09 | Paper |
The competition number of a graph with exactly \(h\) holes, all of which are independent | 2009-06-30 | Paper |
Distance-two labellings of Hamming graphs | 2009-06-24 | Paper |
Note on the \(m\)-step competition numbers of paths and cycles | 2009-06-24 | Paper |
On the \((n,t)\)-antipodal Gray codes | 2009-06-22 | Paper |
\(L(h,k)\)-labelings of Hamming graphs | 2009-06-19 | Paper |
A note on equitable colorings of forests | 2009-06-17 | Paper |
\(k\)-tuple domination in graphs | 2009-04-28 | Paper |
On the rank of a cograph | 2008-06-17 | Paper |
The upper bound on \(k\)-tuple domination numbers of graphs | 2008-05-29 | Paper |
Clique coverings and partitions of line graphs | 2008-04-28 | Paper |
A managed Bayesian risk approach for decision making alternatives | 2008-04-03 | Paper |
Distance graphs on \(\mathbb R^n\) with 1-norm | 2008-02-18 | Paper |
Profile minimization on compositions of graphs | 2008-02-18 | Paper |
Group testing in graphs | 2008-02-18 | Paper |
Adaptive group testing for consecutive positives | 2008-02-11 | Paper |
Node-disjoint paths in hierarchical hypercube networks | 2007-10-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3439683 | 2007-05-29 | Paper |
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups | 2007-05-11 | Paper |
Induced-path partition on graphs with special blocks | 2007-02-26 | Paper |
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs | 2007-02-13 | Paper |
Optimal Consecutive-k−Out−of−n Systems under a Fixed Budget | 2007-01-19 | Paper |
Isometric path numbers of graphs | 2006-09-14 | Paper |
Power domination in graphs | 2006-09-13 | Paper |
Profile minimization on products of graphs | 2006-06-30 | Paper |
STACS 2005 | 2005-12-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q5466046 | 2005-08-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q5461468 | 2005-07-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q5461588 | 2005-07-26 | Paper |
Path partition for graphs with special blocks | 2005-02-23 | Paper |
The weighted independent domination problem is NP-complete for chordal graphs | 2004-11-23 | Paper |
Vertex and tree arboricities of graphs | 2004-11-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4736226 | 2004-08-09 | Paper |
Geodetic spectra of graphs. | 2004-03-14 | Paper |
Interval numbers of powers of block graphs | 2004-02-02 | Paper |
Centers and medians of distance-hereditary graphs | 2003-05-25 | Paper |
Distance-two labelings of graphs | 2003-04-09 | Paper |
Corrigendum to ``The path-partition problem in block graphs. | 2003-01-21 | Paper |
Group testing in bipartite graphs | 2002-12-02 | Paper |
A note on the Gallai-Roy-Vitaver theorem | 2002-12-02 | Paper |
\(k\)-subdomination in graphs | 2002-08-29 | Paper |
Total interval numbers of complete \(r\)-partite graphs | 2002-08-29 | Paper |
Domination in distance-hereditary graphs | 2002-08-24 | Paper |
Families of graphs closed under taking powers | 2002-05-13 | Paper |
The \(K_r\)-packing problem | 2002-01-24 | Paper |
Algorithmic aspect of \(k\)-tuple domination in graphs. | 2002-01-01 | Paper |
Minimum Span of No-Hole (r+1)-Distant Colorings | 2001-11-11 | Paper |
The number of maximum independent sets in graphs | 2001-08-30 | Paper |
Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs | 2001-08-20 | Paper |
Channel graphs of bit permutation networks | 2001-08-20 | Paper |
CORRIGENDA ON “NEW COMPARISONS IN BIRNBAUM IMPORTANCE FOR THE CONSECUTIVE-k-OUT-OF-n SYSTEM” | 2001-05-07 | Paper |
Linear \(k\)-arboricities on trees | 2001-04-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q2703797 | 2001-03-15 | Paper |
Sortabilities of partition properties | 2001-03-04 | Paper |
Localizing combinatorial properties for partitions on block graphs | 2001-03-04 | Paper |
The \(\beta\)-assignment problems | 2001-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4262015 | 2000-11-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4515736 | 2000-11-23 | Paper |
Pseudo-Hamiltonian-connected graphs | 2000-06-29 | Paper |
Circular chromatic numbers of distance graphs with distance sets missing multiples | 2000-06-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4486258 | 2000-06-26 | Paper |
The path-partition problem in block graphs | 2000-06-21 | Paper |
Reliabilities for \((n,f,k)\) systems | 2000-06-07 | Paper |
\(T\)-colorings and \(T\)-edge spans of graphs | 2000-05-18 | Paper |
Bipartite Steinhaus graphs | 2000-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4943526 | 2000-03-16 | Paper |
Distance graphs and \(T\)-coloring | 2000-01-30 | Paper |
The circular chromatic number of the Mycielskian ofGdk | 2000-01-02 | Paper |
Algorithmic aspects of linear \(k\)-arboricity | 1999-12-05 | Paper |
Wide diameters of butterfly networks | 1999-12-05 | Paper |
Onk-ary spanning trees of tournaments | 1999-11-14 | Paper |
Fault-tolerant routing in circulant networks and cycle prefix networks | 1999-11-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4268431 | 1999-10-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4232775 | 1999-08-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4239764 | 1999-08-10 | Paper |
The number of maximal independent sets in connected triangle-free graphs | 1999-08-09 | Paper |
Rabin numbers of Butterfly networks | 1999-08-09 | Paper |
Generalized diameters and Rabin numbers of networks | 1999-07-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4242729 | 1999-05-11 | Paper |
A unique arithmetic labeling of hexagonal lattices | 1999-03-09 | Paper |
Weighted connected domination and Steiner trees in distance-hereditary graphs | 1999-02-01 | Paper |
The path-partition problem in bipartite distance-hereditary graphs | 1999-01-03 | Paper |
Circular chromatic numbers of Mycielski's graphs | 1999-01-01 | Paper |
k-Neighborhood-Covering and -Independence Problems for Chordal Graphs | 1998-09-21 | Paper |
Circular chromatic numbers and fractional chromatic numbers of distance graphs | 1998-09-16 | Paper |
Enumerating consecutive and nested partitions for graphs | 1998-07-19 | Paper |
The Hamiltonian property of the consecutive-3 digraphs | 1998-06-25 | Paper |
\(k\)-path partitions in trees | 1998-06-11 | Paper |
A simple and direct derivation for the number of noncrossing partitions | 1998-05-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4385251 | 1998-04-13 | Paper |
Algorithmic aspects of majority domination | 1998-03-02 | Paper |
Maximal independent sets in graphs with at most one cycle | 1998-02-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4247463 | 1998-01-01 | Paper |
Medians of graphs and kings of tournaments | 1997-12-07 | Paper |
Integral distance graphs | 1997-12-07 | Paper |
The \(\beta\)-assignment problem in general graphs | 1997-10-26 | Paper |
Optimality of consecutive and nested tree partitions | 1997-10-26 | Paper |
The exact gossiping problem | 1997-10-09 | Paper |
Proper interval graphs and the guard problem | 1997-08-10 | Paper |
Quasi-threshold graphs | 1997-02-26 | Paper |
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs | 1997-01-13 | Paper |
A finiteness theorem for maximal independent sets | 1996-12-12 | Paper |
Weighted independent perfect domination on cocomparability graphs | 1996-08-05 | Paper |
The partial gossiping problem | 1996-03-24 | Paper |
Corrigendum to ``A comparison theorem for permanents and a proof of a conjecture on \((t,m)\)-families, by Joseph Y.- T. Leung and W.-D. Wei | 1996-02-26 | Paper |
The edge domination problem | 1995-11-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4309148 | 1995-01-09 | Paper |
Edge domatic numbers of complete \(n\)-partite graphs | 1994-12-11 | Paper |
The domatic number problem | 1994-11-24 | Paper |
The w‐median of a connected strongly chordal graph | 1994-11-06 | Paper |
Algorithmic Aspects of Neighborhood Numbers | 1993-06-29 | Paper |
Set to set broadcasting in communication networks | 1993-05-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4020464 | 1993-01-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q3988082 | 1992-06-28 | Paper |
Centers of chordal graphs | 1992-06-27 | Paper |
An upper bound for the transversal numbers of 4-uniform hypergraphs | 1992-06-25 | Paper |
The k-neighbor domination problem | 1991-01-01 | Paper |
The Domatic Number Problem in Interval Graphs | 1990-01-01 | Paper |
On the number of SDR of a (t,n)-family | 1989-01-01 | Paper |
Total domination in block graphs | 1989-01-01 | Paper |
Labeling algorithms for domination problems in sun-free chordal graphs | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3818327 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3835465 | 1988-01-01 | Paper |
The minimum of the antichains in the factor poset | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3808243 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3749069 | 1986-01-01 | Paper |
The poset scheduling problem | 1985-01-01 | Paper |
Diagonal and pandiagonal tournament Latin squares | 1985-01-01 | Paper |
Covering, Packing and Generalized Perfection | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3778772 | 1985-01-01 | Paper |
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3037444 | 1983-01-01 | Paper |
Group testing with two defectives | 1982-01-01 | Paper |
R-domination of block graphs | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3960885 | 1981-01-01 | Paper |
A Group Testing Problem on Two Disjoint Sets | 1981-01-01 | Paper |
A Group Testing Problem | 1980-01-01 | Paper |
Complete Diagonals of Latin Squares | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4182573 | 1977-01-01 | Paper |