Path-bicolorable graphs. (Extended abstract)
From MaRDI portal
Publication:3655151
DOI10.1007/978-3-642-02029-2_17zbMATH Open1194.05036OpenAlexW1543659517MaRDI QIDQ3655151FDOQ3655151
Van Bang Le, Andreas Brandstädt, Martin Charles Golumbic, Marina Lipshteyn
Publication date: 7 January 2010
Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_17
Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- Graph Classes: A Survey
- Complement reducible graphs
- Modular decomposition and transitive orientation
- The strong perfect graph theorem
- A Linear Recognition Algorithm for Cographs
- A note on superbrittle graphs
- On graph powers for leaf-labeled trees
- Some classes of perfectly orderable graphs
- Structure and linear time recognition of 3-leaf powers
- The subchromatic number of a graph
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- More about subcolorings
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- P-Components and the Homogeneous Decomposition of Graphs
- Split-Perfect Graphs: Characterizations and Algorithmic Use
- Split graphs of Dilworth number 2
- Chordal probe graphs
- Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
- Alternating orientation and alternating colouration of perfect graphs
- Graph Subcolorings: Complexity and Algorithms
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
Cited In (2)
Recommendations
This page was built for publication: Path-bicolorable graphs. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655151)
