On the public citation graph
On P_4-tidy graphs
0 signed · 94 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-52048-1_28openalex-snapshot
A linear-time recognition algorithm for P 4-reducible graphs
inferredcites →https://doi.org/10.1007/978-94-009-5315-4_2openalex-snapshot
Algorithmic Aspects of Comparability Graphs and Interval Graphs
inferredcites →https://doi.org/10.1007/bf02253613openalex-snapshot
Hamiltonicity in graphs with fewP 4's
inferredcites →https://doi.org/10.1007/bfb0017474openalex-snapshot
A new linear algorithm for Modular Decomposition
inferredcites →https://doi.org/10.1016/0095-8956(78)90013-8openalex-snapshot
On a class of posets and the corresponding comparability graphs
inferredcites →https://doi.org/10.1016/0095-8956(85)90050-4openalex-snapshot
Weakly triangulated graphs
inferredcites →https://doi.org/10.1016/0166-218x(81)90013-5openalex-snapshot
Complement reducible graphs
inferredcites →https://doi.org/10.1016/0166-218x(91)90085-bopenalex-snapshot
On a unique tree representation for P4-extendible graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90036-aopenalex-snapshot
A tree representation for P4-sparse graphs
inferredcites →https://doi.org/10.1016/0166-218x(92)90180-iopenalex-snapshot
P4-trees and substitution decomposition
inferredcites →https://doi.org/10.1016/0166-218x(94)00012-3openalex-snapshot
Linear time optimization algorithms for P4-sparse graphs
inferredcites →https://doi.org/10.1016/0304-3975(95)00016-popenalex-snapshot
A linear-time recognition algorithm for P4-reducible graphs
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0012-365x(96)00177-xopenalex-snapshot
On semi-P4-sparse graphs
inferredcites →https://doi.org/10.1016/s0012-365x(96)00180-xopenalex-snapshot
Scattering number and modular decomposition
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72966-9openalex-snapshot
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
inferredcites →https://doi.org/10.1137/0214065openalex-snapshot
A Linear Recognition Algorithm for Cographs
inferredcites →https://doi.org/10.1137/0221027openalex-snapshot
Recognizing $P_4 $-Sparse Graphs in Linear Time
inferredcites →https://doi.org/10.1137/s0895480191196812openalex-snapshot
P-Components and the Homogeneous Decomposition of Graphs
inferredcites →https://doi.org/10.5555/314464.314641openalex-snapshot
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20200openalex-snapshot
A linear‐time algorithm for the k‐fixed‐endpoint path cover problem on cographs
inferred← citeshttps://doi.org/10.1007/10692760_1openalex-snapshot
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_7openalex-snapshot
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4’s
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_21openalex-snapshot
Counting Spanning Trees in Graphs Using Modular Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_28openalex-snapshot
The Packing Coloring Problem for (q,q-4) Graphs
inferred← citeshttps://doi.org/10.1007/s002249910009openalex-snapshot
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
inferred← citeshttps://doi.org/10.1007/s00373-011-1123-1openalex-snapshot
Recognizing Well Covered Graphs of Families with Special P 4-Components
inferred← citeshttps://doi.org/10.1007/s00373-015-1651-1openalex-snapshot
Vizing Bound for the Chromatic Number on Some Graph Classes
inferred← citeshttps://doi.org/10.1007/s10479-014-1537-2openalex-snapshot
Restricted coloring problems on Graphs with few P 4’s
inferred← citeshttps://doi.org/10.1007/s10479-017-2712-zopenalex-snapshot
Neighborhood covering and independence on $$P_4$$P4-tidy graphs and tree-cographs
inferred← citeshttps://doi.org/10.1007/s13173-011-0053-3openalex-snapshot
On clique-colouring of graphs with few P4’s
inferred← citeshttps://doi.org/10.1007/s40840-026-02055-zopenalex-snapshot
Grundy Double Domination Number: Bounds, Graph Operations, and Efficient Computation for $$P_4$$-Tidy Graphs
inferred← citeshttps://doi.org/10.1007/s41980-025-01017-8openalex-snapshot
On the Stress Transit Function
inferred← citeshttps://doi.org/10.1016/j.amc.2019.01.074openalex-snapshot
Hitting subgraphs in P4-tidy graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2004.02.017openalex-snapshot
Linear-time modular decomposition of directed graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2005.09.002openalex-snapshot
The clique operator on graphs with few P4 's
inferred← citeshttps://doi.org/10.1016/j.dam.2009.12.009openalex-snapshot
First-Fit coloring of {P5,K4−e} -free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.06.020openalex-snapshot
Partial characterizations of circle graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.10.002openalex-snapshot
On the b -coloring of P4 -tidy graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.017openalex-snapshot
b -coloring of tight graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.01.025openalex-snapshot
Minimal separators in extended P4 -laden graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.12.021openalex-snapshot
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
inferred← citeshttps://doi.org/10.1016/j.dam.2013.04.001openalex-snapshot
On minimal forbidden subgraph characterizations of balanced graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.05.019openalex-snapshot
On some graph classes related to perfect graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.008openalex-snapshot
On some special classes of contact B 0 -VPG graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.06.042openalex-snapshot
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
inferred← citeshttps://doi.org/10.1016/j.dam.2023.05.016openalex-snapshot
Partitioning P4 -tidy graphs into a stable set and a forest
inferred← citeshttps://doi.org/10.1016/j.dam.2024.12.014openalex-snapshot
χ -boundedness and related problems on graphs without long induced paths: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2026.03.028openalex-snapshot
Tree t-spanners for edge adjacency distances
inferred← citeshttps://doi.org/10.1016/j.disc.2011.02.021openalex-snapshot
Bounding χ in terms of ω and Δ for some classes of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.08.017openalex-snapshot
The cluster deletion problem for cographs
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.10.002openalex-snapshot
Total dominating sequences in trees, split graphs, and under modular decomposition
inferred← citeshttps://doi.org/10.1016/j.ejc.2026.104345openalex-snapshot
Graph classes with few P 4 ’s: Universality and Brownian graphon limits
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.032openalex-snapshot
On -sparse graphs and other families
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.008openalex-snapshot
On minimal forbidden subgraph characterizations of balanced graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.013openalex-snapshot
Minimal separators in P 4 -tidy graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.071openalex-snapshot
The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.011openalex-snapshot
Restricted coloring problems on graphs with few
inferred← citeshttps://doi.org/10.1016/j.endm.2011.05.058openalex-snapshot
Probe interval and probe unit interval graphs on superclasses of cographs
inferred← citeshttps://doi.org/10.1016/j.endm.2015.07.031openalex-snapshot
Some links between identifying codes and separating, dominating and total dominating sets in graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.10.051openalex-snapshot
On graphs with a single large Laplacian eigenvalue
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.09.002openalex-snapshot
The multiple domination and limited packing problems in graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.08.011openalex-snapshot
An optimal parallel solution for the path cover problem on -sparse graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.012openalex-snapshot
Counting spanning trees using modular decomposition
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.014openalex-snapshot
Generalized limited packings of some graphs with a limited number of P4 -partners
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00295-4openalex-snapshot
Clique-width of partner-limited graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00081-1openalex-snapshot
An O(n) time algorithm for maximum matching in P4-tidy graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00221-3openalex-snapshot
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00220-7openalex-snapshot
Bandwidth and topological bandwidth of graphs with few P4's
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00180-xopenalex-snapshot
On variations of P4-sparse graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80014-9openalex-snapshot
SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
inferred← citeshttps://doi.org/10.1051/ro/2025012openalex-snapshot
Structural characterizations of tree t-spanners for graphs with few P4’s and (0, ℓ)-graphs
inferred← citeshttps://doi.org/10.1080/00207160.2014.881994openalex-snapshot
Clique-perfectness and balancedness of some graph classes
inferred← citeshttps://doi.org/10.1080/00207160410001661690openalex-snapshot
Relationships between scattering number and other vulnerability parameters
inferred← citeshttps://doi.org/10.1093/comjnl/bxm052openalex-snapshot
Width Parameters Beyond Tree-width and their Applications
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00050openalex-snapshot
Assessing the Existence of a Function in a Dataset with the g3 Indicator
inferred← citeshttps://doi.org/10.1137/1.9781611975031.176openalex-snapshot
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
inferred← citeshttps://doi.org/10.1142/s0129054199000241openalex-snapshot
ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
inferred← citeshttps://doi.org/10.1145/3310228openalex-snapshot
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
inferred← citeshttps://doi.org/10.14778/1920841.1920975openalex-snapshot
Read-once functions and query evaluation in probabilistic databases
inferred← citeshttps://doi.org/10.26493/2590-9770.1422.9b6openalex-snapshot
Hierarchical and modularly-minimal vertex colorings
inferred← citeshttps://doi.org/10.46298/dmtcs.2082openalex-snapshot
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.602openalex-snapshot
Probe interval graphs and probe unit interval graphs on superclasses of cographs
inferred← citeshttps://doi.org/10.46298/dmtcs.8440openalex-snapshot
Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0804.4093openalex-snapshot
Reconstruction of p-disconnected graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1508.02559openalex-snapshot
The Thue choice number versus the Thue chromatic number of graphs
inferred← citeshttps://doi.org/10.5753/etc.2018.3142openalex-snapshot
Problema de partição em conjunto independente e árvore quando restrito à classe dos grafos-P4-tidy
inferred← citeshttps://doi.org/10.70675/4e7c000ez56eaz4b5bza55ezfaf097f06815openalex-snapshot
Domain knowledge and functions in data science, application to hydroelectricity production
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.