Characterizations of derived graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Forbidden graphs for degree and neighbourhood conditions
- Pancyclicity of claw-free Hamiltonian graphs
- The dynamics of the line and path graph operators
- A simple upper bound for the hamiltonian index of a graph
- Claw-free graphs---a survey
- Packing cycles in graphs
- Mock threshold graphs
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
- A coloring algorithm for \(4 K_1\)-free line graphs
- The maximum cardinality cut problem in co-bipartite chain graphs
- On contact graphs of paths on a grid
- On edge-sets of bicliques in graphs
- Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem
- A characterization of signed graphs represented by root system \(D_ \infty\)
- Graphs with least eigenvalue -2; a historical survey and recent developments in maximal exceptional graphs
- Application of cut polyhedra. I
- Reconstructing a graph from its arc incidence graph
- Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts
- On clique immersions in line graphs
- Finding the root graph through minimum edge deletion
- On a relation between \(k\)-path partition and \(k\)-path vertex cover
- On graphs whose second largest eigenvalue is at most 1
- On coloring a class of claw-free and hole-twin-free graphs
- The feasibility problem for line graphs
- A complete characterization of graphs with exactly two positive eigenvalues
- Characterizations of line graphs in signed and gain graphs
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs
- On coloring a class of claw-free graphs.
- Index of parameters of iterated line graphs
- Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
- On the structure of graphs without claw, \(4K_1\) and co-R
- Free fermions behind the disguise
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- The intersection of two vertex coloring problems
- Sprague-Grundy function of matroids and related hypergraphs
- Disjoint paired-dominating sets in cubic graphs
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- On \(\bullet\)-line signed graphs \(L_\bullet(S)\)
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Heavy subgraphs, stability and Hamiltonicity
- Polynomial kernelization for removing induced claws and diamonds
- On line graphs of subcubic triangle-free graphs
- Claw-free strictly Deza graphs
- From matchings to independent sets
- Even cycles and even 2-factors in the line graph of a simple graph
- Triangle packings and transversals of some \(K_{4}\)-free graphs
- The signature of two generalizations of line graphs
- Characterization of classical graph classes by weighted clique graphs
- Line graphs of bounded clique-width
- NP-hard graph problems and boundary classes of graphs
- A characterization of 2-tree probe interval graphs
- Characterization of n-path graphs and of graphs having n-th root
- The staggered quantum walk model
- Graphs with induced-saturation number zero
- Perfect graphs with no balanced skew-partition are 2-clique-colorable
- Quartic graphs with every edge in a triangle
- Polynomial kernelization for removing induced claws and diamonds
- A comparison on metric dimension of graphs, line graphs, and line graphs of the subdivision graphs
- Induced cycles in triangle graphs
- Equivalence of four descriptions of generalized line graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- scientific article; zbMATH DE number 4214057 (Why is no real title available?)
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- A bibliography of graph equations
- A characterization of line graphs that are squares of graphs
- scientific article; zbMATH DE number 64359 (Why is no real title available?)
- Minimal line graphs
- List monopolar partitions of claw-free graphs
- On the connectedness of 3-line graphs
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Tight frame graphs arising as line graphs
- Counting weighted independent sets beyond the permanent
- The structure of graphs with forbidden induced \(C_4\), \(\overline{C}_4\), \(C_5\), \(S_3\), chair and co-chair
- Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
- On leap indices of CNCk[n] by using line operator on its subdivision
- Line graphs of unit graphs associated with the direct product of rings
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
- scientific article; zbMATH DE number 7528055 (Why is no real title available?)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
- The Capacitated and Economic Districting Problem
- Tree cover number and maximum semidefinite nullity of some graph classes
- EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS
- The distinguishing number and the distinguishing index of line and graphoidal graph(s)
- Line zero divisor graphs
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
- The edge \(C_k\) graph of a graph
- Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs
- Identifying codes in line graphs
- Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
- A Polynomial Kernel for Line Graph Deletion
- scientific article; zbMATH DE number 7661095 (Why is no real title available?)
- Binary contraction of graphs
- On the parameterized complexity of the acyclic matching problem
- Counting independent sets in graphs with bounded bipartite pathwidth
- Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
This page was built for publication: Characterizations of derived graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5601346)