Erfang Shan

Yisai Xue

Discret. Math., January, 2024

2023

Corrigendum to "A new axiomatization of the Shapley-solidarity value for games with a coalition structure" [Oper. Res. Lett. 46 (2018) 163-167].

[BibT_eX]

[DOI]

Oper. Res. Lett., November, 2023

Union-wise egalitarian solutions in cooperative games with a coalition structure.

[BibT_eX]

[DOI]

Zhiqiang Yu

Wenrong Lyu

4OR, September, 2023

Marginality and a Characterization of the Owen Graph value.

[BibT_eX]

[DOI]

Int. J. Game Theory, June, 2023

The two-step average tree value for graph and hypergraph games.

[BibT_eX]

[DOI]

Anna B. Khmelnitskaya

Dolf Talman

Ann. Oper. Res., April, 2023

The efficient partition surplus Owen graph value.

[BibT_eX]

[DOI]

Wenrong Lyu

Ann. Oper. Res., 2023

2022

Consistency and the graph Banzhaf value for communication graph games.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

Safety of links with respect to the Myerson value for communication situations.

[BibT_eX]

[DOI]

Oper. Res., 2022

A value for cooperative games with coalition and probabilistic graph structures.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs.

[BibT_eX]

[DOI]

Yisai Xue

Discret. Math., 2022

The Turán number of Berge-matching in hypergraphs.

[BibT_eX]

[DOI]

Zhenyu Ni

Discret. Math., 2022

2021

Egalitarian allocation and players of certain type.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

The average tree value for hypergraph games.

[BibT_eX]

[DOI]

Anna B. Khmelnitskaya

Dolf Talman

Math. Methods Oper. Res., 2021

The principal eigenvector to α-spectral radius of hypergraphs.

[BibT_eX]

[DOI]

Jing Wang

J. Comb. Optim., 2021

The spectral radius and domination number in linear uniform hypergraphs.

[BibT_eX]

[DOI]

Wei Zhang

J. Comb. Optim., 2021

Cooperative games with partial information.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2021

On a Conjecture for Power Domination.

[BibT_eX]

[DOI]

Min Zhao

Graphs Comb., 2021

Decomposing uniform hypergraphs into uniform hypertrees and single edges.

[BibT_eX]

[DOI]

Zhenyu Ni

Discret. Math., 2021

Extremal graphs for blow-ups of stars and paths.

[BibT_eX]

[DOI]

Hui Zhu

Discret. Appl. Math., 2021

The Banzhaf value for generalized probabilistic communication situations.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2021

2020

The Turán Number of Berge-K4 in 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

The Myerson value for directed graph games.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

Marginal contributions and derivatives for set functions in cooperative games.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Extremal Graphs for Odd-Ballooning of Paths and Cycles.

[BibT_eX]

[DOI]

Hui Zhu

Graphs Comb., 2020

Extremal Graphs for Blow-Ups of Keyrings.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Power domination in the generalized Petersen graphs.

[BibT_eX]

[DOI]

Min Zhao

Discuss. Math. Graph Theory, 2020

List-coloring clique-hypergraphs of K5-minor-free graphs strongly.

[BibT_eX]

[DOI]

Jianliang Wu

Discret. Math., 2020

Efficient quotient extensions of the Myerson value.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2020

A Note on the Position Value for Hypergraph Communication Situations.

[BibT_eX]

[DOI]

Wenrong Lv

Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

2019

The efficient proportional Myerson values.

[BibT_eX]

[DOI]

Jiayu Han

Oper. Res. Lett., 2019

A linear-time algorithm for clique-coloring planar graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

The α-spectral radius of uniform hypergraphs concerning degrees and domination number.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

The clique-perfectness and clique-coloring of outer-planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

The eigenvectors to the p-spectral radius of general hypergraphs.

[BibT_eX]

[DOI]

Lele Liu

J. Comb. Optim., 2019

Maximally connected p-partite uniform hypergraphs.

[BibT_eX]

[DOI]

Jing Zhao

Discret. Appl. Math., 2019

The extremal α-index of outerplanar and planar graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

The position value and the structures of graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

2018

The connected p-center problem on cactus graphs.

[BibT_eX]

[DOI]

Chunsong Bai

Theor. Comput. Sci., 2018

The w-centroids and least w-central subtrees in weighted trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Algorithms for connected p-centdian problem on block graphs.

[BibT_eX]

[DOI]

Jianjie Zhou

J. Comb. Optim., 2018

The degree value for games with communication structure.

[BibT_eX]

[DOI]

Xiaokang Shan

Int. J. Game Theory, 2018

The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four.

[BibT_eX]

[DOI]

Graphs Comb., 2018

On the irregularity of uniform hypergraphs.

[BibT_eX]

[DOI]

Lele Liu

Eur. J. Comb., 2018

Trees with unique least central subtrees.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

Extremal hypergraphs for matching number and domination number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Domination in intersecting hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

The Matching Polynomials and Spectral Radii of Uniform Supertrees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees.

[BibT_eX]

[DOI]

Lele Liu

Electron. J. Comb., 2018

2017

Two efficient values of cooperative games with graph structure based on τ-values.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

A linear-time algorithm for clique-coloring problem in circular-arc graphs.

[BibT_eX]

[DOI]

Yuzhong Zhang

J. Comb. Optim., 2017

Cost sharing on prices for games on graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Matching and domination numbers in r-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

The clique-transversal set problem in {claw, K4}-free planar graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Asymptotic sharpness of bounds on hypertrees.

[BibT_eX]

[DOI]

Yi Lin

Discuss. Math. Graph Theory, 2017

The Spectral Radius and Domination Number of Uniform Hypergraphs.

[BibT_eX]

[DOI]

Wei Zhang

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Component-wise proportional solutions for communication graph games.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2016

Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties.

[BibT_eX]

[DOI]

Qi Wei

J. Syst. Sci. Complex., 2016

An efficient algorithm for distance total domination in block graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

3-Factor-Criticality in Double Domination Edge Critical Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Clique-Perfectness of Claw-Free Planar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Clique-Coloring Claw-Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Paired-domination in claw-free graphs with minimum degree at least four.

[BibT_eX]

Xinguo Cao

Ars Comb., 2016

w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

The Connected p-Center Problem on Cactus Graphs.

[BibT_eX]

[DOI]

Chunsong Bai

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Two paths location of a tree with positive or negative weights.

[BibT_eX]

[DOI]

Jianjie Zhou

Theor. Comput. Sci., 2015

Coloring clique-hypergraphs of graphs with no subdivision of K5.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

The clique-transversal set problem in claw-free graphs with degree at most 4.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Signed mixed dominating functions in complete bipartite graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2015

Constructing the minimum dominating sets of generalized de Bruijn digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Upper signed k-domination number in graphs.

[BibT_eX]

Ligang Zhou

Ars Comb., 2015

The Connected p-Centdian Problem on Block Graphs.

[BibT_eX]

[DOI]

Jianjie Zhou

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs.

[BibT_eX]

[DOI]

Qi Wei

Theor. Comput. Sci., 2014

Clique-transversal sets and clique-coloring in planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

On the numbers of cut-vertices and end-blocks in 4-regular graphs.

[BibT_eX]

[DOI]

Dingguo Wang

Discuss. Math. Graph Theory, 2014

Independent sets in {claw, K4}-free 4-regular graphs.

[BibT_eX]

[DOI]

Dingguo Wang

Discret. Math., 2014

The 2-maxian problem on cactus graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2014

2013

Paired-Domination in Claw-Free Graphs.

[BibT_eX]

[DOI]

Shenwei Huang

Graphs Comb., 2013

Signed total k-domination in graphs.

[BibT_eX]

Ars Comb., 2013

Signed total domination on Kronecker products of two complete graphs.

[BibT_eX]

[DOI]

Hossein Abdollahzadeh Ahangar

Australas. J Comb., 2013

2012

Perfect matchings in paired domination vertex critical graphs.

[BibT_eX]

[DOI]

Shenwei Huang

J. Comb. Optim., 2012

On the super connectivity of Kronecker products of graphs.

[BibT_eX]

[DOI]

Hechao Wang

Wei Wang

Inf. Process. Lett., 2012

The signed maximum-clique transversal number of regular graphs.

[BibT_eX]

[DOI]

Dingguo Wang

Int. J. Comput. Math., 2012

The k-tuple twin domination in generalized de Bruijn and Kautz networks.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2012

2011

A note on the upper bound for the paired-domination number of a graph with minimum degree at least two.

[BibT_eX]

[DOI]

Shenwei Huang

Networks, 2011

Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

The Signed Total Domination Number of Graphs.

[BibT_eX]

Mingjing Gao

Ars Comb., 2011

Claw-free cubic graphs with clique-transversal number half of their order.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

2010

On the k-tuple domination of generalized de Brujin and Kautz digraphs.

[BibT_eX]

[DOI]

Lingye Wu

Zengrong Liu

Inf. Sci., 2010

Signed clique-transversal functions in graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

On characterization of uniquely 3-list colorable complete multipartite graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

Some matching properties in 4-gamma×2-critical graphs.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2010

2009

The twin domination number in generalized de Bruijn digraphs.

[BibT_eX]

[DOI]

Yukun Cheng

Inf. Process. Lett., 2009

Matching Properties in Total Domination Vertex Critical Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2009

Total Restrained Domination in Cubic Graphs.

[BibT_eX]

[DOI]

Hongxing Jiang

Graphs Comb., 2009

Upper bounds on the upper signed total domination number of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

A polynomial-time algorithm for the paired-domination problem on permutation graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Minus Edge Domination in Graphs.

[BibT_eX]

Min Zhao

Ars Comb., 2009

Upper minus total domination of a 5-regular graph.

[BibT_eX]

Ars Comb., 2009

An upper bound on the restrained domination number of graphs.

[BibT_eX]

Mingjing Gao

Ars Comb., 2009

2008

Clique-transversal Number in Cubic Graphs.

[BibT_eX]

Discret. Math. Theor. Comput. Sci., 2008

Remarks on the minus (signed) total domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

On matching and total domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

An application of the Turán theorem to domination in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Proof of a conjecture on k-tuple domination in graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2008

2007

Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph".

[BibT_eX]

[DOI]

Michael A. Henning

J. Graph Theory, 2007

Absorbant of generalized de Bruijn digraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Upper minus total domination in small-degree regular graphs.

[BibT_eX]

[DOI]

Hong Yan

Xiaoqi Yang

Discret. Math., 2007

Bondage number in oriented graphs.

[BibT_eX]

Ars Comb., 2007

The algorithmic complexity of the minus clique-transversal problem.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2007

Clique-Transversal Sets in Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2007

2006

Power domination in block graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Acyclic domination on bipartite permutation graphs.

[BibT_eX]

[DOI]

Guangjun Xu

Inf. Process. Lett., 2006

Total minus domination in k-partite graphs.

[BibT_eX]

[DOI]

Louis Caccetta

Discret. Math., 2006

2005

A note on domination and minus domination numbers in cubic graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2005

2004

A note on balance vertices in trees.

[BibT_eX]

[DOI]

Discret. Math., 2004

A note on Nordhaus-Gaddum inequalities for domination.

[BibT_eX]

[DOI]

Chuangyin Dang

Discret. Appl. Math., 2004

A characterization of trees with equal total domination and paired-domination numbers.

[BibT_eX]

[DOI]

Michael A. Henning

Australas. J Comb., 2004

2003

Lower bounds on the minus domination and k-subdomination numbers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Upper bounds on signed 2-independence number of graphs.

[BibT_eX]

Moo Young Sohn

Ars Comb., 2003

2002

Upper bounds for the k-subdomination number of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

2000

Lower bounds on dominating functions in graphs.

[BibT_eX]