Jing Huang

Jephian C.-H. Lin

SIAM J. Discret. Math., March, 2024

Comparability digraphs: An analogue of comparability graphs.

[BibT_eX]

[DOI]

Xiao-Lu Gao

Shou-Jun Xu

Discret. Math., March, 2024

2023

Obstructions for acyclic local tournament orientation completions.

[BibT_eX]

[DOI]

Kevin Hsu

Discret. Math., 2023

2022

Semi-strict chordality of digraphs.

[BibT_eX]

[DOI]

Ying Ying Ye

CoRR, 2022

Semi-strict Chordal Digraphs.

[BibT_eX]

[DOI]

Ying Ying Ye

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Strong Chordality of Graphs with Possible Loops.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Good orientations of unions of edge-disjoint spanning trees.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Corrigendum to "(k, l)-colourings and Ferrers diagram representations of cographs" [European J. Combin. 91 (2021) 103208].

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

(k, l)-colourings and Ferrers diagram representations of cographs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Chordality of locally semicomplete and weakly quasi-transitive digraphs.

[BibT_eX]

[DOI]

Ying Ying Ye

Discret. Math., 2021

2020

Min-Orderable Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Bipartite Analogues of Comparability and Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

End-Vertices of AT-free Bigraphs.

[BibT_eX]

[DOI]

Jan Gorzny

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Chronological rectangle digraphs which are two-terminal series-parallel.

[BibT_eX]

[DOI]

Josh Manzer

Discret. Appl. Math., 2019

Strongly chordal digraphs and Γ-free matrices.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Completing orientations of partially oriented graphs.

[BibT_eX]

[DOI]

Xuding Zhu

J. Graph Theory, 2018

Non-edge orientation and vertex ordering characterizations of some classes of bigraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Interval-Like Graphs and Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Lexicographic Orientation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Classes of Directed Graphs., 2018

2017

End-vertices of LBFS of (AT-free) bigraphs.

[BibT_eX]

[DOI]

Jan Gorzny

Discret. Appl. Math., 2017

2015

A Brooks-Type Theorem for the Bichromatic Number.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Chronological Rectangle Digraphs.

[BibT_eX]

[DOI]

Josh Manzer

Electron. Notes Discret. Math., 2015

2014

On the Polarity and Monopolarity of Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Solving Partition Problems with Colour-Bipartitions.

[BibT_eX]

[DOI]

Graphs Comb., 2014

2013

Recognition and Characterization of Chronological Interval Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Decomposing locally semicomplete digraphs into strong spanning subdigraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2012

List monopolar partitions of claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Line-Polar Graphs: Characterization and Recognition.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Complexity of Cycle Transverse Matching Problems.

[BibT_eX]

[DOI]

Xuding Zhu

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

A note on the bichromatic numbers of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Recognizing line-polar bipartite graphs in time O(n).

[BibT_eX]

[DOI]

Tínaz Ekim

Discret. Appl. Math., 2010

2009

Adjusted Interval Digraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Extension problems with degree bounds.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Near-Unanimity Functions and Varieties of Reflexive Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Boris Goldengorin

J. Heuristics, 2008

2007

The structure of bi-arc trees.

[BibT_eX]

[DOI]

Discret. Math., 2007

List homomorphisms of graphs with bounded degrees.

[BibT_eX]

[DOI]

Discret. Math., 2007

Recognizing and representing proper interval graphs in parallel using merging and sorting.

[BibT_eX]

[DOI]

Louis Ibarra

Discret. Appl. Math., 2007

Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs.

[BibT_eX]

[DOI]

Dong Ye

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006

Representation characterizations of chordal bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2006

2005

A generalization of the theorem of Lekkerkerker and Boland.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Interval bigraphs and circular arc graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

2003

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Bi-arc graphs and the complexity of list homomorphisms.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

2002

Convex-round graphs are circular-perfect.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Pushing vertices in digraphs without long induced cycles.

[BibT_eX]

[DOI]

Gary MacGillivray

Discret. Appl. Math., 2002

2001

Pushing the cycles out of multipartite tournaments.

[BibT_eX]

[DOI]

Gary MacGillivray

Kathryn L. B. Wood

Discret. Math., 2001

Nearly-acyclically pushable tournaments.

[BibT_eX]

[DOI]

Kathryn L. B. Wood

Australas. J Comb., 2001

2000

Convex-Round and Concave-Round Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

1999

List Homomorphisms and Circular Arc Graphs.

[BibT_eX]

[DOI]

Comb., 1999

Which digraphs are round?

[BibT_eX]

[DOI]

Australas. J Comb., 1999

1998

Maximal and Minimal Vertex-Critical Graphs of Diameter Two.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1998

Kings in quasi-transitive digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

A Note on Spanning Local Tournaments in Locally Semicomplete Digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

Two remarks on circular arc graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1997

1996

A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs.

[BibT_eX]

[DOI]

Binay K. Bhattacharya

SIAM J. Discret. Math., 1996

Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs.

[BibT_eX]

[DOI]

Xiaotie Deng

SIAM J. Comput., 1996

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Discret. Math., 1996

1995

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Quasi-transitive digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

On the Structure of Local Tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1995

Weakly Hamiltonian-connected ordinary multipartite tournaments.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Discret. Math., 1995

1993

In-Tournament Digraphs.

[BibT_eX]

[DOI]

Erich Prisner

J. Comb. Theory, Ser. B, 1993

1992

Recognition and Representation of Proper Circular Arc Graphs.

[BibT_eX]

Xiaotie Deng

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990

Local Tournaments and Proper Circular Arc Gaphs.

[BibT_eX]

[DOI]