researcher

C. Hoàng

30 papers hereh-index 262.1k citations110 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author4
first author7
middle author12
last author7

Across the 30 of 30 papers where every author was matched, so the position is known.

fields

cs.DM14
math.CO14
cs.CC1
cs.DS1

identity via Semantic Scholar / OpenAlex

activity

20062026

most citedEdge Intersection Graphs of L-Shaped Paths in Grids

16 citations · 48 across the 24 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DM2020

A class of graphs with large rankwidth

Chính Hoàng, Nicolas Trotignon

We describe several graphs with arbitrarily large rankwidth (or equivalently with arbitrarily large cliquewidth). Korpelainen, Lozin, and Mayhill [Split permutation graphs, Graphs…

math.CO2020★ 1 cited

Dichotomizing $k$ -vertex-critical $H$ -free graphs for $H$ of order four

Ben Cameron, Chính T. Hoàng, Joe Sawada

For $k \geq 3$ , we prove (i) there is a finite number of $k$ -vertex-critical $(P_{2} + ℓ P_{1})$ -free graphs and (ii) $k$ -vertex-critical $(P_{3} + P_{1})$ -free graphs have at most $2 k - 1$ v…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

A class of graphs with large rankwidth

Dichotomizing k-vertex-critical H-free graphs for H of order four

Dichotomizing $k$ -vertex-critical $H$ -free graphs for $H$ of order four