|
+
PDF
Chat
|
A Closure Lemma for tough graphs and Hamiltonian degree conditions
|
2024
|
Chı́nh T. Hoàng
Cléophée Robin
|
|
+
PDF
Chat
|
A class of graphs with large rankwidth
|
2024
|
Chı́nh T. Hoàng
Nicolas Trotignon
|
|
+
|
Vertex-critical <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e185" altimg="si23.svg"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo linebreak="goodbreak" linebreakstyle="after">+</mml:mo><mml:mi>ℓ</mml:mi><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>-free and vertex-critical (gem, …
|
2023
|
Tala Abuadas
Ben Cameron
Chı́nh T. Hoàng
Joe Sawada
|
|
+
|
A class of graphs with large rankwidth
|
2023
|
Chı́nh T. Hoàng
Nicolas Trotignon
|
|
+
PDF
Chat
|
A refinement on the structure of vertex-critical (P5, gem)-free graphs
|
2023
|
Ben Cameron
Chı́nh T. Hoàng
|
|
+
|
A Closure Lemma for tough graphs and Hamiltonian degree conditions
|
2023
|
Chı́nh T. Hoàng
Cleophee Robin
|
|
+
|
Infinite families of $k$-vertex-critical ($P_5$, $C_5$)-free graphs
|
2023
|
Ben Cameron
Chı́nh T. Hoàng
|
|
+
|
Vertex coloring (4K1, hole-twin, 5-wheel)-free graphs
|
2022
|
Yingjun Dai
Angèle M. Foley
Chı́nh T. Hoàng
|
|
+
PDF
Chat
|
Dichotomizing <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e539" altimg="si29.svg"><mml:mi>k</mml:mi></mml:math>-vertex-critical <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e544" altimg="si30.svg"><mml:mi>H</mml:mi></mml:math>-free graphs for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e549" altimg="si30.svg"><mml:mi>H</mml:mi></mml:math> of order four
|
2022
|
Ben Cameron
Chı́nh T. Hoàng
Joe Sawada
|
|
+
|
Vertex-critical $(P_3+\ell P_1)$-free and vertex-critical (gem, co-gem)-free graphs
|
2022
|
Tala Abuadas
Ben Cameron
Chı́nh T. Hoàng
Joe Sawada
|
|
+
|
A refinement on the structure of vertex-critical ($P_5$, gem)-free graphs
|
2022
|
Ben Cameron
Chı́nh T. Hoàng
|
|
+
PDF
Chat
|
A Refinement on the Structure of Vertex-Critical (P5, Gem)-Free Graphs
|
2022
|
Ben Cameron
Chı́nh T. Hoàng
|
|
+
|
On coloring a class of claw-free and hole-twin-free graphs
|
2021
|
Yingjun Dai
Angèle M. Foley
Chı́nh T. Hoàng
|
|
+
PDF
Chat
|
A class of graphs with large rankwidth
|
2020
|
Chı́nh T. Hoàng
Nicolas Trotignon
|
|
+
|
Dichotomizing $k$-vertex-critical $H$-free graphs for $H$ of order four
|
2020
|
Ben Cameron
Chı́nh T. Hoàng
Joe Sawada
|
|
+
PDF
Chat
|
The Intersection of Two Vertex Coloring Problems
|
2019
|
Angèle M. Foley
Dallas J. Fraser
Chı́nh T. Hoàng
Kevin J. Holmes
Tom P. LaMantia
|
|
+
PDF
Chat
|
Classes of Graphs with $e$-Positive Chromatic Symmetric Function
|
2019
|
Angèle M. Foley
Chı́nh T. Hoàng
Owen Merkel
|
|
+
|
On Coloring a Class of Claw-free Graphs
|
2019
|
Yingjun Dai
Angèle M. Foley
Chı́nh T. Hoàng
|
|
+
|
The intersection of two vertex coloring problems
|
2019
|
Angèle M. Foley
Dallas J. Fraser
Chı́nh T. Hoàng
Kevin J. Holmes
Tom P. LaMantia
|
|
+
PDF
Chat
|
Chromatic symmetric functions and H-free graphs
|
2019
|
Angèle M. Hamel
Chı́nh T. Hoàng
Jake E. Tuero
|
|
+
|
The intersection of two vertex coloring problems
|
2019
|
Angèle M. Foley
Dallas J. Fraser
Chı́nh T. Hoàng
Kevin Holmes
Tom P. LaMantia
|
|
+
|
Classes of graphs with e-positive chromatic symmetric function
|
2018
|
Angèle M. Foley
Chı́nh T. Hoàng
Owen Merkel
|
|
+
PDF
Chat
|
On the structure of (banner, odd hole)‐free graphs
|
2018
|
Chı́nh T. Hoàng
|
|
+
|
Classes of graphs with e-positive chromatic symmetric function
|
2018
|
Angèle M. Foley
Chı́nh T. Hoàng
Owen Merkel
|
|
+
|
Chromatic symmetric functions and H-free graphs
|
2017
|
Angèle M. Hamel
Chı́nh T. Hoàng
Jake E. Tuero
|
|
+
PDF
Chat
|
A coloring algorithm for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-free line graphs
|
2017
|
Dallas J. Fraser
Angèle M. Hamel
Chı́nh T. Hoàng
Frédéric Maffray
|
|
+
PDF
Chat
|
On the structure of (pan, even hole)‐free graphs
|
2017
|
Kathie Cameron
Steven Chaplick
Chı́nh T. Hoàng
|
|
+
|
Solving the clique cover problem on (bull, $C_4$)-free graphs
|
2017
|
Kathie Cameron
Chı́nh T. Hoàng
|
|
+
|
Solving the clique cover problem on (bull, $C_4$)-free graphs
|
2017
|
Kathie Cameron
Chı́nh T. Hoàng
|
|
+
|
Chromatic symmetric functions and H-free graphs
|
2017
|
Angèle M. Hamel
Chı́nh T. Hoàng
Jake E. Tuero
|
|
+
|
Characterizations of (<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:…
|
2016
|
Dallas J. Fraser
Angèle M. Hamel
Chı́nh T. Hoàng
Kevin J. Holmes
Tom P. LaMantia
|
|
+
|
On color-critical (<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>,co-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs
|
2016
|
Harjinder S. Dhaliwal
Angèle M. Hamel
Chı́nh T. Hoàng
Frédéric Maffray
Tyler J. D. McConnell
Stefan A. Panait
|
|
+
|
On the structure of (banner, odd hole)-free graphs
|
2015
|
Chı́nh T. Hoàng
|
|
+
|
On the structure of (pan, even hole)-free graphs
|
2015
|
Kathie Cameron
Steven Chaplick
Chı́nh T. Hoàng
|
|
+
|
A Coloring Algorithm for $4K_1$-free line graphs
|
2015
|
Dallas J. Fraser
Angèle M. Hamel
Chı́nh T. Hoàng
|
|
+
|
Edge intersection graphs of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si61.gif" display="inline" overflow="scroll"><mml:mi>L</mml:mi></mml:math>-shaped paths in grids
|
2015
|
Kathie Cameron
Steven Chaplick
Chı́nh T. Hoàng
|
|
+
|
On the structure of (pan, even hole)-free graphs
|
2015
|
Kathie Cameron
Steven Chaplick
Chı́nh T. Hoàng
|
|
+
|
On the structure of (banner, odd hole)-free graphs
|
2015
|
Chı́nh T. Hoàng
|
|
+
|
A Coloring Algorithm for $4K_1$-free line graphs
|
2015
|
Dallas J. Fraser
Angèle M. Hamel
Chı́nh T. Hoàng
|
|
+
|
Polynomial-time algorithms for minimum weighted colorings of ($P_5, \bar{P}_5$)-free graphs and related graph classes.
|
2014
|
Chı́nh T. Hoàng
D. Adam Lazzarato
|
|
+
|
Constructions of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-critical<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si12.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs
|
2014
|
Chı́nh T. Hoàng
Brian Moore
Daniel Recoskie
Joe Sawada
Martin Vatshelle
|
|
+
|
On color-critical ($P_{5},\overline{P}_5$)-free graphs
|
2014
|
Harjinder S. Dhaliwal
Angèle M. Hamel
Chı́nh T. Hoàng
Frédéric Maffray
Tyler J. D. McConnell
Stefan A. Panait
|
|
+
|
Polynomial-time algorithms for minimum weighted colorings of ($P_5, \bar{P}_5$)-free graphs and related graph classes
|
2014
|
Chı́nh T. Hoàng
D. Adam Lazzarato
|
|
+
|
On color-critical ($P_{5},\overline{P}_5$)-free graphs
|
2014
|
Harjinder S. Dhaliwal
Angèle M. Hamel
Chı́nh T. Hoàng
Frédéric Maffray
Tyler J. D. McConnell
Stefan A. Panait
|
|
+
|
On k-critical -free graphs
|
2013
|
Chı́nh T. Hoàng
Brian Moore
Daniel Recoskie
Joe Sawada
|
|
+
PDF
Chat
|
Edge Intersection Graphs of L-Shaped Paths in Grids
|
2013
|
Kathie Cameron
Steven Chaplick
Chı́nh T. Hoàng
|
|
+
PDF
Chat
|
A characterization of b-perfect graphs
|
2012
|
Chı́nh T. Hoàng
Frédéric Maffray
Meriem Mechebbek
|
|
+
PDF
Chat
|
A Characterization of b‐Perfect Graphs
|
2011
|
Chı́nh T. Hoàng
Frédéric Maffray
Meriem Mechebbek
|
|
+
PDF
Chat
|
Finding a Sun in Building-Free Graphs
|
2011
|
Elaine M. Eschen
Chı́nh T. Hoàng
Jeremy Spinrad
R. Sritharan
|
|
+
|
Characterizing directed path graphs by forbidden asteroids
|
2010
|
Kathie Cameron
Chı́nh T. Hoàng
Benjamin Lévêque
|
|
+
|
On graphs without a <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math> or a diamond
|
2010
|
Elaine M. Eschen
Chı́nh T. Hoàng
Jeremy Spinrad
R. Sritharan
|
|
+
PDF
Chat
|
On the Complexity of Finding a Sun in a Graph
|
2010
|
Chı́nh T. Hoàng
|
|
+
|
A characterization of b-perfect graphs
|
2010
|
Chı́nh T. Hoàng
Frédéric Maffray
Meriem Mechebbek
|
|
+
|
On minimally b-imperfect graphs
|
2009
|
Chı́nh T. Hoàng
Cláudia Linhares Sales
Frédéric Maffray
|
|
+
PDF
Chat
|
Asteroids in rooted and directed path graphs
|
2009
|
Kathie Cameron
Chı́nh T. Hoàng
Benjamin Lévêque
|
|
+
PDF
Chat
|
Asteroids in rooted and directed path graphs
|
2009
|
Kathie Cameron
Chı́nh T. Hoàng
Benjamin Lévêque
|
|
+
PDF
Chat
|
A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
|
2009
|
Daniel Bruce
Chı́nh T. Hoàng
Joe Sawada
|
|
+
|
A certifying algorithm for 3-colorability of P5-free graphs
|
2009
|
Daniel Bruce
Chı́nh T. Hoàng
Joe Sawada
|
|
+
|
Finding a sun in building-free graphs
|
2009
|
Elaine M. Eschen
Chı́nh T. Hoàng
Jeremy Spinrad
R. Sritharan
|
|
+
|
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
|
2009
|
Elaine M. Eschen
Chı́nh T. Hoàng
R. Sritharan
Lorna Stewart
|
|
+
|
On graphs without a C4 or a diamond
|
2009
|
Elaine M. Eschen
Chı́nh T. Hoàng
Jeremy Spinrad
R. Sritharan
|
|
+
|
Asteroids in rooted and directed path graphs
|
2008
|
Kathie Cameron
Chı́nh T. Hoàng
Benjamin Lévêque
|
|
+
PDF
Chat
|
A Note on k-Colorability of P 5-Free Graphs
|
2008
|
Chı́nh T. Hoàng
Marcin Kamiński
Vadim Lozin
Joe Sawada
Xiao Shu
|
|
+
|
On the complexity of finding a sun in a graph
|
2008
|
Chı́nh T. Hoàng
|
|
+
|
Maximum Induced Matchings for Chordal Graphs in Linear Time
|
2007
|
Andreas Brandstädt
Chı́nh T. Hoàng
|
|
+
|
Deciding k-colourability of $P_5$-free graphs in polynomial time
|
2007
|
Chı́nh T. Hoàng
Marcin Kamiński
Vadim Lozin
Joe Sawada
Xiao Shu
|
|
+
|
Recognition of Perfect Circular-arc Graphs
|
2006
|
Kathie Cameron
Elaine M. Eschen
Chı́nh T. Hoàng
R. Sritharan
|
|
+
|
k-Colorability of P5-free graphs
|
2006
|
Chı́nh T. Hoàng
Joe Sawada
Xiao Shu
|
|
+
|
On the b-dominating coloring of graphs
|
2005
|
Chı́nh T. Hoàng
Mekkia Kouider
|
|
+
|
On minimal prime extensions of a four-vertex graph in a prime graph
|
2004
|
Andreas Brandstädt
Chı́nh T. Hoàng
Jean-Marie Vanherpe
|
|
+
|
Coloring the hypergraph of maximal cliques of a graph with no long path
|
2003
|
Sylvain Gravier
Chı́nh T. Hoàng
Frédéric Maffray
|
|
+
|
On simplicial and co-simplicial vertices in graphs
|
2003
|
Chı́nh T. Hoàng
Stefan Hougardy
Frédéric Maffray
N. V. R. Mahadev
|
|
+
|
Stability number of bull- and chair-free graphs revisited
|
2003
|
Andreas Brandstädt
Chı́nh T. Hoàng
Van Bang Lê
|
|
+
|
On the divisibility of graphs
|
2002
|
Chı́nh T. Hoàng
Colin McDiarmid
|
|
+
|
On P4-transversals of perfect graphs
|
2000
|
Chı́nh T. Hoàng
Van Bang Lê
|
|
+
|
On the disc-structure of perfect graphs I the co-paw-structure
|
1999
|
Chı́nh T. Hoàng
|
|
+
|
Some properties of minimal imperfect graphs
|
1996
|
Chı́nh T. Hoàng
|
|
+
|
A note on perfectly orderable graphs
|
1996
|
Chı́nh T. Hoàng
|
|
+
|
Hamiltonian degree conditions for tough graphs
|
1995
|
Chı́nh T. Hoàng
|
|
+
|
On the two‐edge‐colorings of perfect graphs
|
1995
|
Chı́nh T. Hoàng
|
|
+
|
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
|
1994
|
Chı́nh T. Hoàng
|
|
+
|
On slim graphs, even pairs, and star-cutsets
|
1992
|
Chı́nh T. Hoàng
Frédéric Maffray
|
|
+
|
A charming class of perfectly orderable graphs
|
1992
|
Chı́nh T. Hoàng
Frédéric Maffray
Stephan Olariu
Myriam Preissmann
|
|
+
|
New properties of perfectly orderable graphs and strongly perfect graphs
|
1991
|
Chı́nh T. Hoàng
Frédéric Maffray
Myriam Preissmann
|
|
+
|
Opposition graphs are strict quasi-parity graphs
|
1989
|
Chı́nh T. Hoàng
Frédéric Maffray
|
|
+
|
A note on perfect orders
|
1989
|
Chı́nh T. Hoàng
N.V.R. Mahadev
|
|
+
|
On brittle graphs
|
1988
|
Chı́nh T. Hoàng
N. Khouzam
|
|
+
|
A note on short cycles in diagraphs
|
1987
|
Chı́nh T. Hoàng
Bruce Reed
|
|
+
|
On a conjecture of Meyniel
|
1987
|
Chı́nh T. Hoàng
|