Query：
学者姓名：陈容
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
In this paper, we prove that for each connected odd-hole-free graph G, χ(G)≤max{Δ(G)−1,ω(G)} if and only if G is not isomorphic to the complement of C7. © 2025 Elsevier B.V.
Keyword ：
Random number generation Random number generation
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Rong , Lan, Kaiyang , Lin, Xinheng et al. The chromatic number of odd-hole-free graphs [J]. | Discrete Applied Mathematics , 2025 , 370 : 84-87 . |
| MLA | Chen, Rong et al. "The chromatic number of odd-hole-free graphs" . | Discrete Applied Mathematics 370 (2025) : 84-87 . |
| APA | Chen, Rong , Lan, Kaiyang , Lin, Xinheng , Zhou, Yidong . The chromatic number of odd-hole-free graphs . | Discrete Applied Mathematics , 2025 , 370 , 84-87 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The Borodin-Kostochka Conjecture states that for a graph G, if Delta(G)>= 9\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta (G)\ge 9$$\end{document}, then chi(G)<= max{Delta(G)-1,omega(G)}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\chi (G)\le \max \{\Delta (G)-1,\omega (G)\}$$\end{document}. In this paper, we prove the Borodin-Kostochka Conjecture holding for odd-hole-free graphs.
Keyword ：
Borodin-Kostochka conjecture Borodin-Kostochka conjecture Chromatic number Chromatic number Odd-hole-free graphs Odd-hole-free graphs
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Rong , Lan, Kaiyang , Lin, Xinheng et al. Borodin-Kostochka Conjecture Holds for Odd-Hole-Free Graphs [J]. | GRAPHS AND COMBINATORICS , 2024 , 40 (2) . |
| MLA | Chen, Rong et al. "Borodin-Kostochka Conjecture Holds for Odd-Hole-Free Graphs" . | GRAPHS AND COMBINATORICS 40 . 2 (2024) . |
| APA | Chen, Rong , Lan, Kaiyang , Lin, Xinheng , Zhou, Yidong . Borodin-Kostochka Conjecture Holds for Odd-Hole-Free Graphs . | GRAPHS AND COMBINATORICS , 2024 , 40 (2) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
We say that a graph G has an odd K-4 -subdivision if some subgraph of G is isomorphic to a K-4 -subdivision which if embedded in the plane the boundary of each of its faces has odd length and is an induced cycle of G. For a number l >= 2, let ge denote the family of graphs which have girth 2l + 1 and have no odd hole with length greater than 2l + 1. Wu, Xu and Xu conjectured that every graph in U (l >= 2) g(l) is 3 -colorable. Recently, Chudnovsky et al. and Wu et al., respectively, proved that every graph in g(2) and g(3) is 3 -colorable. In this paper, we prove that no 4 -vertex -critical graph in Ue>5 ge has an odd K-4 -subdivision. Using this result, Chen proved that all graphs in U-l>5 ge are 3 -colorable.
Keyword ：
chromatic number chromatic number odd holes odd holes
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Rong , Zhou, Yidong . Graphs with Girth 2l+1 and Without Longer Odd Holes that Contain an Odd K4 -Subdivision [J]. | ELECTRONIC JOURNAL OF COMBINATORICS , 2024 , 31 (1) . |
| MLA | Chen, Rong et al. "Graphs with Girth 2l+1 and Without Longer Odd Holes that Contain an Odd K4 -Subdivision" . | ELECTRONIC JOURNAL OF COMBINATORICS 31 . 1 (2024) . |
| APA | Chen, Rong , Zhou, Yidong . Graphs with Girth 2l+1 and Without Longer Odd Holes that Contain an Odd K4 -Subdivision . | ELECTRONIC JOURNAL OF COMBINATORICS , 2024 , 31 (1) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
For a number l >= 2, let G(l) denote the family of graphs which have girth 2l+1 and have no odd hole with length greater than 2l+1. Wu et al. conjectured that every graph in U(l >= 2)Gl is 3-colorable. Chudnovsky et al. and Wu et al., respectively, proved that every graph in G(2) and G(3) is 3-colorable. In this paper, we prove that every graph in U(l >= 5)Gl is 3-colorable.
Keyword ：
chromatic number chromatic number girth girth holes holes
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Rong . Graphs with girth 2l+1 and without longer odd holes are 3-colorable [J]. | JOURNAL OF GRAPH THEORY , 2024 , 108 (4) : 661-671 . |
| MLA | Chen, Rong . "Graphs with girth 2l+1 and without longer odd holes are 3-colorable" . | JOURNAL OF GRAPH THEORY 108 . 4 (2024) : 661-671 . |
| APA | Chen, Rong . Graphs with girth 2l+1 and without longer odd holes are 3-colorable . | JOURNAL OF GRAPH THEORY , 2024 , 108 (4) , 661-671 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The Borodin-Kostochka conjecture says that for a connected graph G, if Delta(G) >= 9, then chi(G) <= max{Delta(G) - 1, omega(G)}. In this paper, we prove that the conjecture holds for hammer-free graphs, where a hammer is the graph obtained by identifying one vertex of a triangle and one end vertex of an induced path with three vertices. (c) 2023 Elsevier B.V. All rights reserved.
Keyword ：
Borodin-Kostochka Conjecture Borodin-Kostochka Conjecture Chromatic number Chromatic number Induced subgraphs Induced subgraphs
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Rong , Lan, Kaiyang , Lin, Xinheng . Coloring hammer-free graphs with Δ-1 colors [J]. | DISCRETE MATHEMATICS , 2023 , 347 (3) . |
| MLA | Chen, Rong et al. "Coloring hammer-free graphs with Δ-1 colors" . | DISCRETE MATHEMATICS 347 . 3 (2023) . |
| APA | Chen, Rong , Lan, Kaiyang , Lin, Xinheng . Coloring hammer-free graphs with Δ-1 colors . | DISCRETE MATHEMATICS , 2023 , 347 (3) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A house is the graph that consists of an induced 4-vertex cycle and a single vertex with precisely two adjacent neighbors on the cycle. The Borodin-Kostochka Conjecture states that for each graph G with increment Delta(G) >= 9, we have chi(G) < max{ increment Delta(G) - 1, omega(G)}. We show that this conjecture holds for {P-2 U P-3, house}-free graphs. (c) 2023 Elsevier B.V. All rights reserved.
Keyword ：
Chromatic number Chromatic number Forbidden induced subgraphs Forbidden induced subgraphs Perfect graphs Perfect graphs
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Rong , Lan, Kaiyang , Zhou, Yidong . Coloring {P2 U P3, house}-free graphs with △-1 colors [J]. | DISCRETE APPLIED MATHEMATICS , 2023 , 342 : 12-18 . |
| MLA | Chen, Rong et al. "Coloring {P2 U P3, house}-free graphs with △-1 colors" . | DISCRETE APPLIED MATHEMATICS 342 (2023) : 12-18 . |
| APA | Chen, Rong , Lan, Kaiyang , Zhou, Yidong . Coloring {P2 U P3, house}-free graphs with △-1 colors . | DISCRETE APPLIED MATHEMATICS , 2023 , 342 , 12-18 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
As a challenging problem in computer vision, salient object segmentation has attracted increasing attention in recent years. Though a lot of works based on encoder-decoder have been made, these methods can only recognize and segment one class of objects, but cannot segment the other classes of objects in the same image. To address this issue, this paper proposes a novel decoder based on Bayesian rules to perform task-driven object segmentation, in which a control signal is added to the decoder to determine which class of objects need to be segmented. What's more, a Bayesian rule is established in the decoder, in which the control signal is set as the prior, and the latent features learned in encoder is transferred to the corresponding layer of decoder as observation, thus the posterior probability of each object with respect to the specific-class can be calculated, and the objects belonging to this class can be segmented. This proposed method is evaluated for task-driven salient object segmentation on several benchmark datasets, including MS COCO, DUT-OMRON, ECSSD etc. Experimental results show that the approach tends to segment accurate, detailed, and complete objects, and improves the performance compared with the previous state-of-the-art.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Cai, Yuxiang , Yu, Yuanlong , Jiang, Weijie et al. A novel decoder based on Bayesian rules for task-driven object segmentation [J]. | IET IMAGE PROCESSING , 2022 , 17 (3) : 832-848 . |
| MLA | Cai, Yuxiang et al. "A novel decoder based on Bayesian rules for task-driven object segmentation" . | IET IMAGE PROCESSING 17 . 3 (2022) : 832-848 . |
| APA | Cai, Yuxiang , Yu, Yuanlong , Jiang, Weijie , Chen, Rong , Zheng, Weitao , Wu, Xi et al. A novel decoder based on Bayesian rules for task-driven object segmentation . | IET IMAGE PROCESSING , 2022 , 17 (3) , 832-848 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle, is minor closed and contains both the class of lifted-graphic matroids and the class of frame matroids, each of which generalizes the class of graphic matroids. In this paper, we prove that the matroids U-3,U-7 and U-4,U-7 are the only 9-connected excluded minors for the class of quasi-graphic matroids.
Keyword ：
excluded minors excluded minors matroids matroids quasi-graphic matroids quasi-graphic matroids
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Rong . THE 9-CONNECTED EXCLUDED MINORS FOR THE CLASS OF QUASI-GRAPHIC MATROIDS [J]. | SIAM JOURNAL ON DISCRETE MATHEMATICS , 2022 , 36 (3) : 1627-1644 . |
| MLA | Chen, Rong . "THE 9-CONNECTED EXCLUDED MINORS FOR THE CLASS OF QUASI-GRAPHIC MATROIDS" . | SIAM JOURNAL ON DISCRETE MATHEMATICS 36 . 3 (2022) : 1627-1644 . |
| APA | Chen, Rong . THE 9-CONNECTED EXCLUDED MINORS FOR THE CLASS OF QUASI-GRAPHIC MATROIDS . | SIAM JOURNAL ON DISCRETE MATHEMATICS , 2022 , 36 (3) , 1627-1644 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Nowadays, direct current-drive (DC-drive) is the mainstream method of driving electroluminescence (EL) devices such as quantum-dot light-emitting diodes (QLEDs). In contrast, alternating current-drive (AC-drive), as an alternative to DC-drive, has achieved lots of significant research results in recent years. And AC-drive is expected to reduce equipment manufacturing costs by reducing the use of power converters and rectifiers. However, our understanding of the light-emitting mechanism for QLED under AC-drive is still not thorough. In this work, the optoelectronic characteristics of QLED under different AC-driven frequencies are systematically studied and the equivalent circuit model is proposed by combining the experimental results with simulation results. Moreover, the working mechanism of the equivalent circuit and the carrier transport model are explained in detail, especially under high frequencies. This research helps us deepen our understanding of the working mechanism of QLEDs, broadens the application fields of AC-drive, and paves the way for the further use of AC-driven EL devices.
Keyword ：
Alternating current-drive (AC-drive) Alternating current-drive (AC-drive) Brightness Brightness Capacitors Capacitors equivalent circuit equivalent circuit Equivalent circuits Equivalent circuits High frequency High frequency Integrated circuit modeling Integrated circuit modeling light-emitting diode light-emitting diode quantum-dots quantum-dots Quantum dots Quantum dots Resistors Resistors
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lv, Shanhong , Yang, Kaiyu , Wu, Chaoxing et al. Operating Mechanism of Quantum-Dot Light-Emitting Diodes Under Alternating Current-Drive [J]. | IEEE ELECTRON DEVICE LETTERS , 2022 , 43 (2) : 256-259 . |
| MLA | Lv, Shanhong et al. "Operating Mechanism of Quantum-Dot Light-Emitting Diodes Under Alternating Current-Drive" . | IEEE ELECTRON DEVICE LETTERS 43 . 2 (2022) : 256-259 . |
| APA | Lv, Shanhong , Yang, Kaiyu , Wu, Chaoxing , Wang, Kun , Chen, Rong , Chen, Xiang et al. Operating Mechanism of Quantum-Dot Light-Emitting Diodes Under Alternating Current-Drive . | IEEE ELECTRON DEVICE LETTERS , 2022 , 43 (2) , 256-259 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A signed circuit cover of a signed graph is a natural analog of a circuit cover of a graph, and is equivalent to a covering of its corresponding signed-graphic matroid with circuits. It was conjectured that a signed graph whose signed-graphic matroid has no coloops has a 6-cover. In this paper, we prove that the conjecture holds for signed Eulerian graphs.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Bao, Bo , Chen, Rong , Fan, Genghua . Circuit Covers of Signed Eulerian Graphs [J]. | ELECTRONIC JOURNAL OF COMBINATORICS , 2021 , 28 (1) . |
| MLA | Bao, Bo et al. "Circuit Covers of Signed Eulerian Graphs" . | ELECTRONIC JOURNAL OF COMBINATORICS 28 . 1 (2021) . |
| APA | Bao, Bo , Chen, Rong , Fan, Genghua . Circuit Covers of Signed Eulerian Graphs . | ELECTRONIC JOURNAL OF COMBINATORICS , 2021 , 28 (1) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
