Partitioning P₄-tidy graphs into a stable set and a forest

DOI10.1016/J.DAM.2023.05.016OpenAlexW4379740790WikidataQ122878797 ScholiaQ122878797MaRDI QIDQ6166038FDOQ6166038

Authors: 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

zbMATH Keywords

partitionstable setacyclic setnear-bipartite\(P_4\)-tidy

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx) Graph theory (05Cxx)

Cites Work

• Complement reducible graphs
• On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
• A graph coloring algorithm for large scheduling problems
• On a unique tree representation for \(P_ 4\)-extendible graphs
• A New Class of Brittle Graphs
• Title not available (Why is that?)
• Cycle transversals in perfect graphs and cographs
• VLSI physical design. From graph partitioning to timing closure
• Partition the vertices of a graph into one independent set and one acyclic set
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• P-Components and the Homogeneous Decomposition of Graphs
• Independent feedback vertex sets for graphs of bounded diameter
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
• On graphs with limited number of \(P_{4}\)-partners
• Graph partitioning applied to the logic testing of combinational circuits
• Title not available (Why is that?)
• Independent feedback vertex set for \(P_5\)-free graphs
• Deadlock resolution in wait-for graphs by vertex/arc deletion
• Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
• Automata, Languages and Programming
• Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration

Cited In (2)

• Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets
• Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs

This page was built for publication: Partitioning \(P_4\)-tidy graphs into a stable set and a forest

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166038)