The following pages link to Chính T. Hoàng (Q234396):
Displaying 50 items.
- (Q198205) (redirect page) (← links)
- Edge intersection graphs of \(L\)-shaped paths in grids (Q299080) (← links)
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- A note on short cycles in digraphs (Q580357) (← links)
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
- On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- On minimally \(b\)-imperfect graphs (Q967413) (← links)
- Maximum induced matchings for chordal graphs in linear time (Q1018044) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- On a conjecture of Meyniel (Q1096652) (← links)
- Opposition graphs are strict quasi-parity graphs (Q1118614) (← links)
- \(P_ 4\)-comparability graphs (Q1121924) (← links)
- A note on perfect orders (Q1124614) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- New properties of perfectly orderable graphs and strongly perfect graphs (Q1185094) (← links)
- A charming class of perfectly orderable graphs (Q1193431) (← links)
- A parallel algorithm for minimum weighted colouring of triangulated graphs (Q1193908) (← links)
- On slim graphs, even pairs, and star-cutsets (Q1199476) (← links)
- On the disc-structure of perfect graphs. I: The co-paw-structure (Q1293203) (← links)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) (← links)
- On simplicial and co-simplicial vertices in graphs. (Q1428559) (← links)
- On \(P_4\)-transversals of perfect graphs (Q1567276) (← links)
- Planar segment visibility graphs (Q1581056) (← links)
- On the disc-structure of perfect graphs. II: The co-\(C_4\)-structure (Q1613492) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- On the structure of (even hole, kite)-free graphs (Q1756042) (← links)
- Hamiltonian degree conditions for tough graphs (Q1896350) (← links)
- A note on perfectly orderable graphs (Q1917281) (← links)
- On the complexity of recognizing a class of perfectly orderable graphs (Q1917290) (← links)
- On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs (Q1924145) (← links)
- Finding a sun in building-free graphs (Q1926049) (← links)
- Finding and listing induced paths and cycles (Q1941391) (← links)
- Chromatic symmetric functions and \(H\)-free graphs (Q2000573) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)
- On coloring a class of claw-free graphs. (Q2132368) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- On the sibling-structure of perfect graphs (Q2277483) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- Classes of graphs with \(e\)-positive chromatic symmetric function (Q2325752) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs (Q2373437) (← links)
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803) (← links)
- Solving the clique cover problem on (bull, \(C_4\))-free graphs (Q2414459) (← links)
