Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q122878797 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2023.05.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4379740790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent feedback vertex sets for graphs of bounded diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent feedback vertex set for \(P_5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle transversals in perfect graphs and cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deadlock resolution in wait-for graphs by vertex/arc deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning applied to the logic testing of combinational circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a triangle-free planar graph into a forest and a forest of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Brittle 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: On a unique tree representation for \(P_ 4\)-extendible graphs / 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: VLSI Physical Design: From Graph Partitioning to Timing Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring algorithm for large scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3124737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON GRAPHS WITH LIMITED NUMBER OF P<sub>4</sub>-PARTNERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition the vertices of a graph into one independent set and one acyclic set / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:14, 2 August 2024

scientific article; zbMATH DE number 7721325
Language Label Description Also known as
English
Partitioning \(P_4\)-tidy graphs into a stable set and a forest
scientific article; zbMATH DE number 7721325

    Statements

    Partitioning \(P_4\)-tidy graphs into a stable set and a forest (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 August 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    partition
    0 references
    \(P_4\)-tidy
    0 references
    stable set
    0 references
    acyclic set
    0 references
    near-bipartite
    0 references
    0 references
    0 references