Pages that link to "Item:Q5601346"
From MaRDI portal
The following pages link to Characterizations of derived graphs (Q5601346):
Displayed 50 items.
- On coloring a class of claw-free graphs. (Q2132368) (← links)
- Index of parameters of iterated line graphs (Q2142662) (← links)
- Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications (Q2144878) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- Free fermions behind the disguise (Q2244922) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- Sprague-Grundy function of matroids and related hypergraphs (Q2333808) (← links)
- Disjoint paired-dominating sets in cubic graphs (Q2334075) (← links)
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph (Q2339429) (← links)
- On \(\bullet\)-line signed graphs \(L_\bullet(S)\) (Q2344008) (← links)
- Forbidden subgraphs for longest cycles to contain vertices with large degrees (Q2346330) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs (Q2357785) (← links)
- Heavy subgraphs, stability and Hamiltonicity (Q2364090) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Claw-free strictly Deza graphs (Q2403679) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Even cycles and even 2-factors in the line graph of a simple graph (Q2411500) (← links)
- Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
- The signature of two generalizations of line graphs (Q2419065) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- A characterization of 2-tree probe interval graphs (Q2509539) (← links)
- Characterization of n-path graphs and of graphs having \(n\)-th root (Q2562796) (← links)
- Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540) (← links)
- Quartic Graphs with Every Edge in a Triangle (Q2811200) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- (Q2974133) (← links)
- Equivalence of four descriptions of generalized line graphs (Q2998921) (← links)
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs (Q3081311) (← links)
- (Q3360908) (← links)
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks (Q3439565) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- A bibliography of graph equations (Q3856811) (← links)
- (Q4013456) (← links)
- Minimal line graphs (Q4093483) (← links)
- (Q4622607) (← links)
- Tight Frame Graphs Arising as Line Graphs (Q4987379) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- The structure of graphs with forbidden induced $C_4$, $\overline{C}_4$, $C_5$, $S_3$, chair and co-chair (Q5009982) (← links)
- Graphoidal graphs and graphoidal digraphs: a generalization of line graphs (Q5012356) (← links)
- On leap indices of <i>CNC<sub>k</sub></i>[<i>n</i>] by using line operator on its subdivision (Q5035087) (← links)
- (Q5044003) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- (Q5076787) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- (Q5139648) (← links)