Path-bicolorable graphs (Q659746): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-010-1007-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978057479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subchromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split graphs of Dilworth number 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split-Perfect Graphs: Characterizations and Algorithmic Use / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear time recognition of 3-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: More about subcolorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Subcolorings: Complexity and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal probe graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating orientation and alternating colouration of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some classes of perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time recognition algorithm for \(P_{4}\)-reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Components and the Homogeneous Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on superbrittle graphs / rank
 
Normal rank

Latest revision as of 21:23, 4 July 2024

scientific article
Language Label Description Also known as
English
Path-bicolorable graphs
scientific article

    Statements

    Path-bicolorable graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 January 2012
    0 references
    0 references
    \(P_3\)-bicolorable graphs
    0 references
    \(P_4\)-bicolorable graphs
    0 references
    bipartite graphs
    0 references
    3-leaf powers
    0 references
    linear time recognition
    0 references
    0 references