On the public citation graph
The splittance of a graph
0 signed · 204 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/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1016/0095-8956(71)90030-xopenalex-snapshot
On the planarity of regular incidence sequences
inferredcites →https://doi.org/10.1016/s0167-5060(08)70731-3openalex-snapshot
Aggregation of Inequalities in Integer Programming
inferredcites →https://doi.org/10.1145/800119.803884openalex-snapshot
Some simplified NP-complete problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20270openalex-snapshot
Graph classes characterized both by forbidden subgraphs and degree sequences
inferred← citeshttps://doi.org/10.1002/jgt.20302openalex-snapshot
A Characterization of the degree sequences of 2‐trees
inferred← citeshttps://doi.org/10.1002/jgt.22529openalex-snapshot
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs
inferred← citeshttps://doi.org/10.1002/jgt.3190150302openalex-snapshot
The threshold weight of a graph
inferred← citeshttps://doi.org/10.1006/jctb.1995.1021openalex-snapshot
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture
inferred← citeshttps://doi.org/10.1007/11682462_55openalex-snapshot
Minimal Split Completions of Graphs
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_8openalex-snapshot
Split-Perfect Graphs: Characterizations and Algorithmic Use
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_8openalex-snapshot
Complexity Classification of Some Edge Modification Problems
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_238openalex-snapshot
The maximum k-dependent and f-dependent set problem
inferred← citeshttps://doi.org/10.1007/978-3-030-17402-6_30openalex-snapshot
Subset Feedback Vertex Set in Chordal and Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_11openalex-snapshot
Edge Elimination and Weighted Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_20openalex-snapshot
On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_1openalex-snapshot
Relaxed and Approximate Graph Realizations
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_7openalex-snapshot
Skeleton-Based Clustering by Quasi-Threshold Editing
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_30openalex-snapshot
Transitivity on Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_21openalex-snapshot
Realizing Graphs with Cut Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-34742-8_10openalex-snapshot
Degrees of Distributivity: Quantifying Structural Deviations in Real World Data
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_17openalex-snapshot
Win-Win Kernelization for Degree Sequence Completion Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_34openalex-snapshot
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-41168-2_13openalex-snapshot
Reconstructing Cactus Graphs from Shortest Path Information
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_13openalex-snapshot
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-71150-8_15openalex-snapshot
The Coloring Reconfiguration Problem on Specific Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_43openalex-snapshot
The PIGs Full Monty – A Floor Show of Minimal Separators
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_31openalex-snapshot
Recognizing Bipolarizable and P 4-Simplicial Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_76openalex-snapshot
Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_23openalex-snapshot
Polar Permutation Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_10openalex-snapshot
Faster Parameterized Algorithms for Deletion to Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_16openalex-snapshot
Rainbow Colouring of Split and Threshold Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_30openalex-snapshot
Vector Connectivity in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-44753-6_25openalex-snapshot
A Graph Modification Approach for Finding Core–Periphery Structures in Protein Interaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_35openalex-snapshot
On the Threshold of Intractability
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_8openalex-snapshot
Parameters of Partial Orders and Graphs: Packing, Covering, and Representation
inferred← citeshttps://doi.org/10.1007/978-981-19-9582-8_14openalex-snapshot
Generating Scale-Free Outerplanar Networks
inferred← citeshttps://doi.org/10.1007/978-981-96-2845-2_18openalex-snapshot
Min-Sum Disjoint Paths on Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/s00186-019-00696-4openalex-snapshot
Counting and enumerating independent sets with applications to combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s00224-014-9580-6openalex-snapshot
Finding Disjoint Paths in Split Graphs
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-012-1133-7openalex-snapshot
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1450-0openalex-snapshot
Non-minimal Degree-Sequence-Forcing Triples
inferred← citeshttps://doi.org/10.1007/s00373-018-1953-1openalex-snapshot
Adjacency Relationships Forced by a Degree Sequence
inferred← citeshttps://doi.org/10.1007/s00373-024-02825-1openalex-snapshot
New Tools to Study 1-11-Representation of Graphs
inferred← citeshttps://doi.org/10.1007/s00453-013-9837-5openalex-snapshot
Faster Parameterized Algorithms for Deletion to Split Graphs
inferred← citeshttps://doi.org/10.1007/s00453-019-00590-9openalex-snapshot
Subset Feedback Vertex Set in Chordal and Split Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00817-8openalex-snapshot
Cluster Deletion on Interval Graphs and Split Related Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00822-xopenalex-snapshot
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00969-1openalex-snapshot
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes
inferred← citeshttps://doi.org/10.1007/s004530010026openalex-snapshot
Graph Searching on Some Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1007/s10878-025-01359-3openalex-snapshot
Transitivity in some graph-classes
inferred← citeshttps://doi.org/10.1007/s12209-015-2431-yopenalex-snapshot
Three-rainbow coloring of split graphs
inferred← citeshttps://doi.org/10.1007/s40840-019-00815-8openalex-snapshot
Simple Groups Whose Gruenberg–Kegel Graph or Solvable Graph is Split
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90053-5openalex-snapshot
The network flows approach for matrices with given row and column sums
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90023-2openalex-snapshot
Degree sequences of matrogenic graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90113-5openalex-snapshot
About recognizing (α, β) classes of polar
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90184-1openalex-snapshot
On forcibly hereditary p-graphical sequences
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90394-hopenalex-snapshot
Split dimension of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90152-6openalex-snapshot
Contributions to the theory of graphic sequences
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0062-9openalex-snapshot
Absolute retracts of split graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00296-uopenalex-snapshot
Partitions of graphs into one or two independent sets and cliques
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00334-sopenalex-snapshot
Dominating sets whose closed stars form spanning trees
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90470-9openalex-snapshot
The polytope of degree sequences
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90077-xopenalex-snapshot
Computing the boxicity of a graph by covering its complement by cointerval graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00022-0openalex-snapshot
Linear recognition of pseudo-split graphs
inferred← citeshttps://doi.org/10.1016/b978-0-08-097086-8.43107-7openalex-snapshot
Core–Periphery Patterns in Networks
inferred← citeshttps://doi.org/10.1016/j.aam.2024.102805openalex-snapshot
Fully graphic degree sequences and P-stable degree sequences
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100556openalex-snapshot
A survey of parameterized algorithms and the complexity of edge modification
inferred← citeshttps://doi.org/10.1016/j.dam.2005.09.010openalex-snapshot
On the interval completion of chordal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2006.03.031openalex-snapshot
NP-completeness results for edge modification problems
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.018openalex-snapshot
Minimum edge ranking spanning trees of split graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.028openalex-snapshot
Dynamically maintaining split graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.006openalex-snapshot
Minimum fill-in and treewidth of split+ke and split+kv graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.005openalex-snapshot
Dichotomy for tree-structured trigraph list homomorphism problems
inferred← citeshttps://doi.org/10.1016/j.dam.2011.08.016openalex-snapshot
On the Grundy number of graphs with few P4 ’s
inferred← citeshttps://doi.org/10.1016/j.dam.2012.11.014openalex-snapshot
Co-TT graphs and a characterization of split co-TT graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.030openalex-snapshot
On dominating sets whose induced subgraphs have a bounded diameter
inferred← citeshttps://doi.org/10.1016/j.dam.2013.07.013openalex-snapshot
Automated generation of conjectures on forbidden subgraph characterization
inferred← citeshttps://doi.org/10.1016/j.dam.2015.05.021openalex-snapshot
Rainbow colouring of split graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.030openalex-snapshot
Algorithmic study on 2-transitivity of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.11.032openalex-snapshot
The clique number of the exact distance t -power graph: Complexity and eigenvalue bounds
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.010openalex-snapshot
Hereditary Nordhaus–Gaddum graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.12.065openalex-snapshot
Polarity on H -split graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.07.010openalex-snapshot
Hereditary unigraphs and Erdős–Gallai equalities
inferred← citeshttps://doi.org/10.1016/j.disc.2014.07.016openalex-snapshot
Dominating sequences in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.02.018openalex-snapshot
Minimal forbidden sets for degree sequence characterizations
inferred← citeshttps://doi.org/10.1016/j.disc.2016.04.001openalex-snapshot
Split graphs and Nordhaus–Gaddum graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112755openalex-snapshot
The principal Erdős–Gallai differences of a degree sequence
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113460openalex-snapshot
Forcibly bipartite and acyclic (uni-)graphic sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113483openalex-snapshot
Graph realizations: Maximum degree in vertex neighborhoods
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113857openalex-snapshot
Split graphs and block representations
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114444openalex-snapshot
The hereditary closure of the unigraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114492openalex-snapshot
Tyshkevich's graph decomposition and the distinguishing numbers of unigraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114657openalex-snapshot
Conformality of minimal transversals of maximal cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114703openalex-snapshot
Indivisibility for classes of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.12.007openalex-snapshot
Polar permutation graphs are polynomial-time recognisable
inferred← citeshttps://doi.org/10.1016/j.endm.2004.06.007openalex-snapshot
Computational complexity of edge modification problems in different classes of graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2006.08.060openalex-snapshot
A completely dynamic algorithm for split graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.054openalex-snapshot
Degree Sequence of Tight Distance Graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105302openalex-snapshot
Further results on the Hunters and Rabbit game through monotonicity
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.01.006openalex-snapshot
Antimagic labeling and canonical decomposition of graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106066openalex-snapshot
Algorithms for deletion problems on split graphs
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2019.07.013openalex-snapshot
The graph of atomic divisors and recognition of finite simple groups
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.10.003openalex-snapshot
Editing to Eulerian graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.08.002openalex-snapshot
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.003openalex-snapshot
On the threshold of intractability
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.11.001openalex-snapshot
Incompressibility of H-free edge modification problems: Towards a dichotomy
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103715openalex-snapshot
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.04.007openalex-snapshot
Coloring perfect graphs with no balanced skew-partitions
inferred← citeshttps://doi.org/10.1016/j.laa.2020.12.028openalex-snapshot
Constraints on Brouwer's Laplacian spectrum conjecture
inferred← citeshttps://doi.org/10.1016/j.procs.2023.08.228openalex-snapshot
Polarity on H-split graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.002openalex-snapshot
Hardness of edge-modification problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.020openalex-snapshot
Fast recognition of doubled graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.024openalex-snapshot
The Firefighter problem on graph classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.011openalex-snapshot
Computing role assignments of split graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.022openalex-snapshot
Maximum rooted connected expansion
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.012openalex-snapshot
On vertex-weighted realizations of acyclic and general graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115723openalex-snapshot
Min-Sum disjoint paths on subclasses of chordal graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00009-xopenalex-snapshot
Coloring perfect degenerate graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00082-4openalex-snapshot
An algorithm for coloring some perfect graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00025-9openalex-snapshot
Characterisation of self-complementary chordal graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00262-9openalex-snapshot
On vertex ranking of a starlike graph
inferred← citeshttps://doi.org/10.1016/s0020-0190(96)00134-2openalex-snapshot
P4-laden graphs: A new class of brittle graphs
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10229-xopenalex-snapshot
The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00391-7openalex-snapshot
Complexity classification of some edge modification problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00242-1openalex-snapshot
Parameterized complexity of vertex colouring
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00448-7openalex-snapshot
A fully dynamic algorithm for modular decomposition and recognition of cographs
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00124-2openalex-snapshot
On the use of Boolean methods for the computation of the stability number
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00116-4openalex-snapshot
The complexity of some problems related to Graph 3-colorability
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00071-2openalex-snapshot
Tree- and forest-perfect graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72924-4openalex-snapshot
Classical Perfect Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72942-6openalex-snapshot
Algorithmic Aspects of Perfect Graphs
inferred← citeshttps://doi.org/10.1017/s0963548317000499openalex-snapshot
New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling
inferred← citeshttps://doi.org/10.1038/s41567-021-01417-7openalex-snapshot
Degree-preserving network growth
inferred← citeshttps://doi.org/10.1051/ita/2022001openalex-snapshot
A polynomial time algorithm for geodetic hull number for complementary prisms
inferred← citeshttps://doi.org/10.1051/ro/2023149openalex-snapshot
On two variants of split graphs: 2-unipolar graph and k-probe-split graph
inferred← citeshttps://doi.org/10.1080/03081087.2022.2158171openalex-snapshot
Comparing eigenvector and degree dispersion with the principal ratio of a graph
inferred← citeshttps://doi.org/10.1090/s0002-9947-2011-05393-6openalex-snapshot
The Grone-Merris Conjecture
inferred← citeshttps://doi.org/10.1109/iccasm.2010.5623174openalex-snapshot
A note on antiregular graphs
inferred← citeshttps://doi.org/10.1137/1.9781611972979.10openalex-snapshot
A Characterization of the Degree Sequences of 2-Trees
inferred← citeshttps://doi.org/10.1137/15m1039821openalex-snapshot
Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs
inferred← citeshttps://doi.org/10.1137/19m1280399openalex-snapshot
Graph Classes and Forbidden Patterns on Three Vertices
inferred← citeshttps://doi.org/10.1137/23m1547585openalex-snapshot
On Bipartite Graph Realizations of a Single Degree Sequence
inferred← citeshttps://doi.org/10.1137/s0895480100367676openalex-snapshot
Split-Perfect Graphs: Characterizations and Algorithmic Use
inferred← citeshttps://doi.org/10.1137/s0895480197329089openalex-snapshot
Recognizing Perfect 2-Split Graphs
inferred← citeshttps://doi.org/10.1142/s0129054103001625openalex-snapshot
LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P6-FREE GRAPHS
inferred← citeshttps://doi.org/10.1142/s0129054199000083openalex-snapshot
ON GRAPHS WITH LIMITED NUMBER OF P4-PARTNERS
inferred← citeshttps://doi.org/10.1142/s0129054199000368openalex-snapshot
BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
inferred← citeshttps://doi.org/10.1142/s1793830924500599openalex-snapshot
Strong transitivity of a graph
inferred← citeshttps://doi.org/10.1145/1383369.1383371openalex-snapshot
Fully dynamic algorithms for chordal graphs and split graphs
inferred← citeshttps://doi.org/10.1186/s13015-015-0043-7openalex-snapshot
A graph modification approach for finding core–periphery structures in protein interaction networks
inferred← citeshttps://doi.org/10.14279/depositonce-4415openalex-snapshot
Degree-constrained editing of small-degree graphs
inferred← citeshttps://doi.org/10.14778/3819518.3819554openalex-snapshot
CREST: Approximate k -Clique Counting in Real-World Networks via Refinement of Star-Based Sample Space
inferred← citeshttps://doi.org/10.1515/ausi-2015-0007openalex-snapshot
Recognition of split-graphic sequences
inferred← citeshttps://doi.org/10.15826/umj.2024.2.003openalex-snapshot
REDUCING GRAPHS BY LIFTING ROTATIONS OF EDGES TO SPLITTABLE GRAPHS
inferred← citeshttps://doi.org/10.1587/transinf.2017fcp0007openalex-snapshot
Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes
inferred← citeshttps://doi.org/10.1587/transinf.2018fcp0005openalex-snapshot
The Coloring Reconfiguration Problem on Specific Graph Classes
inferred← citeshttps://doi.org/10.21248/gups.61035openalex-snapshot
Scalable generation of random graphs
inferred← citeshttps://doi.org/10.2139/ssrn.7365669openalex-snapshot
Realizing Graphs with Cut Constraints
inferred← citeshttps://doi.org/10.22108/ijgt.2017.11161openalex-snapshot
Groups for which the noncommuting graph is a split graph
inferred← citeshttps://doi.org/10.2298/aadm150930020mopenalex-snapshot
Graphs with no induced wheel and no induced antiwheel
inferred← citeshttps://doi.org/10.2298/petf0314001mopenalex-snapshot
Antiregular graphs are universal for trees
inferred← citeshttps://doi.org/10.2989/16073606.2021.1947919openalex-snapshot
The independence coloring game on graphs
inferred← citeshttps://doi.org/10.3390/a16060289openalex-snapshot
Adding a Tail in Classes of Perfect Graphs
inferred← citeshttps://doi.org/10.3390/math11153325openalex-snapshot
Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective
inferred← citeshttps://doi.org/10.37236/3683openalex-snapshot
On Fractional Realizations of Graph Degree Sequences
inferred← citeshttps://doi.org/10.37236/7091openalex-snapshot
Finding Balance: Split Graphs and Related Classes
inferred← citeshttps://doi.org/10.37236/8278openalex-snapshot
Split Graphs: Combinatorial Species and Asymptotics
inferred← citeshttps://doi.org/10.46298/dmtcs.351openalex-snapshot
On the Recognition of Bipolarizable and P_4-simplicial Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4145openalex-snapshot
Excluding Degree Sequences of Cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1310.1112openalex-snapshot
On fractional realizations of graph degree sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1502.07484openalex-snapshot
Graphs with no induced wheel or antiwheel
inferred← citeshttps://doi.org/10.48550/arxiv.1710.08953openalex-snapshot
Counting and Enumerating Independent Sets with Applications to Knapsack Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1809.09811openalex-snapshot
Simple Groups Whose Prime Graph or Solvable Graph is Split
inferred← citeshttps://doi.org/10.48550/arxiv.1812.09206openalex-snapshot
Complexity of Partitioning Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1906.00589openalex-snapshot
An upper bound for the clique number using clique ceiling numbers
inferred← citeshttps://doi.org/10.48550/arxiv.2103.02283openalex-snapshot
Pseudoline arrangement graphs: degree sequences and eccentricities
inferred← citeshttps://doi.org/10.48550/arxiv.2107.10660openalex-snapshot
Characterizations for split graphs and unbalanced split graphs
inferred← citeshttps://doi.org/10.70675/1d366b25z29b0z4b44zaef4z87e889a6ee49openalex-snapshot
Graph domination and reconfiguration problems
inferred← citeshttps://doi.org/10.7151/dmgt.2057openalex-snapshot
The bipartite-splittance of a bipartite graph
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.