Suh-Ryung Kim

Discret. Appl. Math., January, 2024

2023

On the limit of the sequence {Cm(D)}m=1∞ for a multipartite tournament D.

[BibT_eX]

[DOI]

Ji-Hwan Jung

Hyesun Yoon

Discret. Appl. Math., December, 2023

Digraphs whose m-step competition graphs are trees.

[BibT_eX]

[DOI]

Myungho Choi

Discret. Appl. Math., October, 2023

The niche graphs of multipartite tournaments.

[BibT_eX]

[DOI]

Myungho Choi

Discuss. Math. Graph Theory, 2023

2022

Structural properties of Toeplitz graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

Competitively orientable complete multipartite graphs.

[BibT_eX]

[DOI]

Myungho Choi

Minki Kwak

Discret. Math., 2022

2021

On chordal phylogeny graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Counting independent sets in Riordan graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

On m-step competition graphs of bipartite tournaments.

[BibT_eX]

[DOI]

Hyesun Yoon

Discret. Appl. Math., 2020

The niche graphs of bipartite tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

On the minimum clique partitioning problem on weighted chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The partial order competition dimensions of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

A graph with the partial order competition dimension greater than five.

[BibT_eX]

[DOI]

Jihoon Choi

Discret. Appl. Math., 2019

2018

A new haplotype block detection method for dense genome sequencing data based on interval graph modeling of clusters of highly correlated SNPs.

[BibT_eX]

[DOI]

Bioinform., 2018

On safe sets of the Cartesian product of two complete graphs.

[BibT_eX]

Bumtle Kang

Ars Comb., 2018

2017

On consecutive edge magic total labelings of connected bipartite graphs.

[BibT_eX]

[DOI]

Bumtle Kang

Ji Yeon Park

J. Comb. Optim., 2017

Comparisons of linkage disequilibrium blocks of different populations for positive selection.

[BibT_eX]

[DOI]

Sun-Ah Kim

Yun Joo Yoo

Int. J. Data Min. Bioinform., 2017

Analysis of triangular motifs in protein interaction networks and their implications to protein ages and cancer genes.

[BibT_eX]

[DOI]

Int. J. Data Min. Bioinform., 2017

On the phylogeny graphs of degree-bounded digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On the partial order competition dimensions of chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On (1, 2)-step competition graphs of bipartite tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Topological properties of protein interaction network and phylogenetic age of proteins.

[BibT_eX]

[DOI]

Hyeonseong Jeon

Yun Joo Yoo

Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

2016

The competition graphs of oriented complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

On the competition graphs of d-partial orders.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Comparisons of linkage disequilibrium blocks of different populations at the sites of natural selection.

[BibT_eX]

[DOI]

Sun-Ah Kim

Yun Joo Yoo

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

2015

A generalization of Opsut's result on the competition numbers of line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

The competition hypergraphs of doubly partial orders.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

On the cores of games arising from integer edge covering functions of graphs.

[BibT_eX]

[DOI]

Hye Kyung Kim

J. Comb. Optim., 2013

The competition number of the complement of a cycle.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Graph Equation for Line Graphs and m-Step Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

On Opsut's conjecture for hypercompetition numbers of hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

The competition numbers of complete multipartite graphs with many partite sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

A Dice Rolling Game on a Set of Tori.

[BibT_eX]

[DOI]

Jeehoon Kang

Electron. J. Comb., 2012

The competition number of a graph and the dimension of its hole space.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2012

2011

The m-step competition graphs of doubly partial orders.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

Graphs having many holes but with small competition numbers.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

2010

The competition numbers of Johnson graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

The competition number of a graph whose holes do not overlap much.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

The competition number of a graph with exactly two holes.

[BibT_eX]

Ars Comb., 2010

2009

The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares.

[BibT_eX]

[DOI]

Discret. Math., 2009

Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p).

[BibT_eX]

Ars Comb., 2009

2008

The competition numbers of complete tripartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

On CCE graphs of doubly partial orders.

[BibT_eX]

[DOI]

Seog-Jin Kim

Yoomi Rho

Discret. Appl. Math., 2007

2006

On the graph inequality thetaE(G) geq thetaE(Gm).

[BibT_eX]

[DOI]

Discret. Math., 2006

On Super Edge-Magic Graphs.

[BibT_eX]

Ji Yeon Park

Ars Comb., 2006

2005

The competition number of a graph having exactly one hole.

[BibT_eX]

[DOI]

Discret. Math., 2005

A class of acyclic digraphs with interval competition graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

On The Trees Whose 2-Step Competition Numbers Are Two.

[BibT_eX]

Yunsun Nam

Ars Comb., 2005

2002

Graphs satisfying inequality Theta(G2)leq Theta(G).

[BibT_eX]

[DOI]

Discret. Math., 2002

Domination graphs of regular tournaments.

[BibT_eX]

[DOI]

J. Richard Lundgren

Discret. Math., 2002

Competition graphs of semiorders and the conditions C(p) and C*(p).

[BibT_eX]

Ars Comb., 2002

2001

Two families of graphs that are not CCE-orientable.

[BibT_eX]

Ars Comb., 2001

2000

The m-step competition graph of a digraph.

[BibT_eX]

[DOI]

Yunsun Nam

Discret. Appl. Math., 2000

1999

On the Inequality dk(G) <= k(G) + 1.

[BibT_eX]

Ars Comb., 1999

1998

The Elimination Procedure for the Competition Number.

[BibT_eX]

Ars Comb., 1998

1997

Competition Numbers of Graphs with a Small Number of Triangles.

[BibT_eX]

[DOI]

Kathryn Fraughnaugh Jones

Discret. Appl. Math., 1997

1993

p-Competition Numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

1992

2-Competition Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

1991

(i, j) competition graphs.

[BibT_eX]

[DOI]

Kim A. S. Hefner

J. Richard Lundgren