Characterizations of derived graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
- Line graph of extensions of the zero-divisor graph in commutative rings
- Clique-coloring of \(K_{3,3}\)-minor free graphs
- The distinguishing number and the distinguishing index of line and graphoidal graph(s)
- A characterization of signed graphs represented by root system \(D_ \infty\)
- Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem
- On the connectedness of 3-line graphs
- A comparison on metric dimension of graphs, line graphs, and line graphs of the subdivision graphs
- A characterization of line graphs that are squares of graphs
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- A simple upper bound for the hamiltonian index of a graph
- The staggered quantum walk model
- New results and open problems in line graphs
- How many conjectures can you stand? A survey
- The edge \(C_k\) graph of a graph
- Binary contraction of graphs
- Line graphs of unit graphs associated with the direct product of rings
- Reconnectads
- Heavy subgraphs, stability and Hamiltonicity
- Closure and forbidden pairs for 2-factors
- Graphs with induced-saturation number zero
- Minimal line graphs
- On finite groups whose power graphs are line graphs
- Fixed-point definability and polynomial time on chordal graphs and line graphs
- Disjoint paired-dominating sets in cubic graphs
- Characterization of classical graph classes by weighted clique graphs
- On clique immersions in line graphs
- The Capacitated and Economic Districting Problem
- Sprague-Grundy function of matroids and related hypergraphs
- The realizability of theta graphs as reconfiguration graphs of minimum independent dominating sets
- Characterizations of line graphs in signed and gain graphs
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- On finite groups whose power graph is claw-free
- On contact graphs of paths on a grid
- scientific article; zbMATH DE number 64359 (Why is no real title available?)
- Schur-positivity for generalized nets
- Forbidden graphs for degree and neighbourhood conditions
- Claw-free strictly Deza graphs
- Claw-free graphs---a survey
- Induced cycles in triangle graphs
- Equivalence of four descriptions of generalized line graphs
- A coloring algorithm for \(4 K_1\)-free line graphs
- Hereditary Nordhaus-Gaddum graphs
- Mock threshold graphs
- scientific article; zbMATH DE number 7661095 (Why is no real title available?)
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
- On edge-sets of bicliques in graphs
- A Polynomial Kernel for Line Graph Deletion
- On coloring a class of claw-free graphs.
- List monopolar partitions of claw-free graphs
- A complete characterization of graphs with exactly two positive eigenvalues
- From matchings to independent sets
- Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
- Finding the root graph through minimum edge deletion
- On a relation between \(k\)-path partition and \(k\)-path vertex cover
- Application of cut polyhedra. I
- The intersection of two vertex coloring problems
- Pancyclicity of claw-free Hamiltonian graphs
- Identifying codes in line graphs
- Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs
- EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS
- New conditions for graph Hamiltonicity
- On line graphs of subcubic triangle-free graphs
- Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
- On the parameterized complexity of the acyclic matching problem
- Generalized line graphs: Cartesian products and complexity of recognition
- One-matching bi-Cayley graph of a commutative ring
- A survey of parameterized algorithms and the complexity of edge modification
- Tree cover number and maximum semidefinite nullity of some graph classes
- Even cycles and even 2-factors in the line graph of a simple graph
- On spectral characterization and embeddings of graphs
- Correcting a graph into a linegraph minimizing Hamming distance edition is NP-complete and FPT by treewidth
- Automated generation of conjectures on forbidden subgraph characterization
- On the conformability of regular line graphs
- Line graphs of bounded clique-width
- Existential closure in line graphs
- Line idempotent graph of some commutative rings
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- On graphs without four-vertex induced subgraphs
- The dynamics of the line and path graph operators
- Switching classes: characterization and computation
- The injective chromatic index of a claw-free subcubic graph is at most 6
- Line graph of annihilating-ideal graph of commutative rings
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts
- Quartic graphs with every edge in a triangle
- NP-hard graph problems and boundary classes of graphs
- First-order logic axiomatization of metric graph theory
- A characterization of line graphs of directed graphs
- Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Packing cycles in graphs
- On leap indices of CNCk[n] by using line operator on its subdivision
- On \(\bullet\)-line signed graphs \(L_\bullet(S)\)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Perfect graphs with no balanced skew-partition are 2-clique-colorable
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)