Path-bicolorable graphs
From MaRDI portal
Publication:659746
DOI10.1007/S00373-010-1007-9zbMATH Open1234.05077OpenAlexW1978057479MaRDI QIDQ659746FDOQ659746
Martin Charles Golumbic, Van Bang Le, Andreas Brandstädt, Marina Lipshteyn
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-1007-9
Recommendations
bipartite graphs\(P_3\)-bicolorable graphs\(P_4\)-bicolorable graphs3-leaf powerslinear time recognition
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 (3)
This page was built for publication: Path-bicolorable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659746)
