Pages that link to "Item:Q5601346"
From MaRDI portal
The following pages link to Characterizations of derived graphs (Q5601346):
Displayed 50 items.
- The staggered quantum walk model (Q265344) (← links)
- Graphs with induced-saturation number zero (Q276201) (← links)
- Induced cycles in triangle graphs (Q298987) (← links)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- A characterization of line graphs that are squares of graphs (Q400504) (← links)
- List monopolar partitions of claw-free graphs (Q442362) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs (Q523723) (← links)
- Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\) (Q536211) (← links)
- Binary contraction of graphs (Q594112) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- Binary representations of regular graphs (Q666512) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- On spectral characterization and embeddings of graphs (Q754883) (← links)
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs (Q783748) (← links)
- Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
- Generalized line graphs: Cartesian products and complexity of recognition (Q888591) (← links)
- Closure and forbidden pairs for 2-factors (Q968435) (← links)
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks (Q998345) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- Forbidden graphs for degree and neighbourhood conditions (Q1119603) (← links)
- Pancyclicity of claw-free Hamiltonian graphs (Q1292881) (← links)
- The dynamics of the line and path graph operators (Q1313351) (← links)
- A simple upper bound for the hamiltonian index of a graph (Q1339866) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Packing cycles in graphs (Q1403928) (← links)
- Mock threshold graphs (Q1637131) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- The maximum cardinality cut problem in co-bipartite chain graphs (Q1698075) (← links)
- On contact graphs of paths on a grid (Q1725765) (← links)
- On edge-sets of bicliques in graphs (Q1759846) (← links)
- Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem (Q1766108) (← links)
- A characterization of signed graphs represented by root system \(D_ \infty\) (Q1814086) (← links)
- Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs (Q1855399) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- Reconstructing a graph from its arc incidence graph (Q1926018) (← links)
- Enumeration of substitutional isomers with restrictive mutual positions of ligands: I. Overall counts (Q1936987) (← links)
- On clique immersions in line graphs (Q2005686) (← links)
- Finding the root graph through minimum edge deletion (Q2028798) (← links)
- On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
- On graphs whose second largest eigenvalue is at most 1 (Q2048359) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- The feasibility problem for line graphs (Q2097181) (← links)
- A complete characterization of graphs with exactly two positive eigenvalues (Q2111197) (← links)
- Characterizations of line graphs in signed and gain graphs (Q2122673) (← links)
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)