The following pages link to Bao-Gang Xu (Q593062):
Displayed 50 items.
- Item:Q593062 (redirect page) (← links)
- On judicious partitions of graphs (Q281768) (← links)
- On the complexity of injective colorings and its generalizations (Q387816) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Some results on acyclic edge coloring of plane graphs (Q407591) (← links)
- Upper bounds on minimum balanced bipartitions (Q409437) (← links)
- Injective choosability of planar graphs of girth five and six (Q409477) (← links)
- A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits (Q477505) (← links)
- On a bipartition problem of Bollobás and Scott (Q624186) (← links)
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- On 3-colorings of plane graphs (Q705042) (← links)
- A note on balanced bipartitions (Q709305) (← links)
- On maximal matchings of connected graphs (Q812460) (← links)
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302) (← links)
- On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
- An analogue of Dirac's theorem on circular super-critical graphs (Q875063) (← links)
- On minimally circular-imperfect graphs (Q932581) (← links)
- A forbidden subgraph characterization of line-polar bipartite graphs (Q968193) (← links)
- A note on list improper coloring of plane graphs (Q1003695) (← links)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- Item:Q593062 (redirect page) (← links)
- A structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles (Q1045104) (← links)
- The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
- On endo-homology of complexes of graphs (Q1584335) (← links)
- On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability (Q1598834) (← links)
- Hajós' conjecture and projective graphs (Q1613489) (← links)
- A note on chromatic number and induced odd cycles (Q1676794) (← links)
- 2-distance coloring of planar graphs with girth 5 (Q1679523) (← links)
- Chromatic number and subtrees of graphs (Q1692708) (← links)
- A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
- A note on strong edge coloring of sparse graphs (Q1734962) (← links)
- Bisections of graphs without \(K_{2, l}\) (Q1735680) (← links)
- Thickness and outerthickness for embedded graphs (Q1744754) (← links)
- Two conjectures equivalent to the perfect graph conjecture (Q1850071) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- Hajós' conjecture and connectivity of Eulerian graphs (Q1868945) (← links)
- On the fixed edge of planar graphs with minimum degree five (Q1917509) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- On minimum balanced bipartitions of triangle-free graphs (Q2015796) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Partitions of multigraphs without \(C_4\) (Q2053675) (← links)
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
- 2-divisibility of some odd hole free graphs (Q2155661) (← links)
- Connectivity of minimum non-5-injectively colorable planar cubic graphs (Q2176826) (← links)
- Partitions of graphs and multigraphs under degree constraints (Q2181223) (← links)
- On partitions of graphs under degree constraints (Q2357778) (← links)
- Optimal relay location for resource-limited energy-efficient wireless communication (Q2433926) (← links)