Partitioning \(P_4\)-tidy graphs into a stable set and a forest
From MaRDI portal
Publication:6166038
DOI10.1016/j.dam.2023.05.016OpenAlexW4379740790WikidataQ122878797 ScholiaQ122878797MaRDI QIDQ6166038
Raquel S. F. Bravo, Rodolfo A. Oliveira, Fábio Nunes da Silva, Uéverton S. Souza
Publication date: 2 August 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.05.016
Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Complement reducible graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
- Independent feedback vertex sets for graphs of bounded diameter
- Independent feedback vertex set for \(P_5\)-free graphs
- Graph partitioning applied to the logic testing of combinational circuits
- Cycle transversals in perfect graphs and cographs
- Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
- Deadlock resolution in wait-for graphs by vertex/arc deletion
- Partition the vertices of a graph into one independent set and one acyclic set
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- A New Class of Brittle Graphs
- VLSI Physical Design: From Graph Partitioning to Timing Closure
- A graph coloring algorithm for large scheduling problems
- P-Components and the Homogeneous Decomposition of Graphs
- ON GRAPHS WITH LIMITED NUMBER OF P4-PARTNERS
- Automata, Languages and Programming
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
This page was built for publication: Partitioning \(P_4\)-tidy graphs into a stable set and a forest
