The following pages link to (Q5570136):
Displayed 50 items.
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected (Q292269) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Characterization of common-edge sigraph (Q385160) (← links)
- On 3-connected Hamiltonian line graphs (Q427827) (← links)
- A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs (Q505460) (← links)
- Group connectivity in line graphs (Q641209) (← links)
- Representation theorems for graphs whose vertex set is partially ordered (Q762181) (← links)
- Graph equations for line graphs, total graphs, middle graphs and quasi- total graphs (Q791547) (← links)
- On minimally circular-imperfect graphs (Q932581) (← links)
- The edge-flipping group of a graph (Q966148) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- Fusion graphs: merging properties and watersheds (Q1009213) (← links)
- The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) (Q1078192) (← links)
- On the problem of how to represent a graph taking into account an additional structure (Q1101469) (← links)
- A polynomial characterization of some graph partitioning problems (Q1108810) (← links)
- Applications of edge coloring of multigraphs to vertex coloring of graphs (Q1121898) (← links)
- Forbidden configurations in intersection graphs of r-graphs (Q1146198) (← links)
- Complexity of representation of graphs by set systems (Q1158768) (← links)
- Connection digraphs and second-order line digraphs (Q1163029) (← links)
- Intersection graphs of k-uniform linear hypergraphs (Q1167187) (← links)
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- Hamiltonicity in claw-free graphs (Q1186134) (← links)
- Graph equations for line graphs and total graphs (Q1220948) (← links)
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets (Q1237785) (← links)
- Pancyclicity of claw-free Hamiltonian graphs (Q1292881) (← links)
- Metric coset schemes revisited (Q1296146) (← links)
- On a problem of walks (Q1296149) (← links)
- Forbidden induced subgraphs for line graphs (Q1336680) (← links)
- Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) (← links)
- The partition of a uniform hypergraph into pairs of dependent hyperedges (Q1356565) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Recognizing intersection graphs of linear uniform hypergraphs (Q1376077) (← links)
- Edge frames of graphs: A graph embedding problem (Q1377875) (← links)
- Heredity of the index of convergence of the line digraph (Q1414247) (← links)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
- A note on chromatic number and induced odd cycles (Q1676794) (← links)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- A characterization problem on underlying graphs of line digraphs (Q1765379) (← links)
- Some applications of Vizing's theorem to vertex colorings of graphs (Q1839256) (← links)
- Line graphs and forbidden induced subgraphs (Q1850532) (← links)
- Complete family reduction and spanning connectivity in line graphs (Q2092434) (← links)
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs (Q2142648) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- Disjoint paired-dominating sets in cubic graphs (Q2334075) (← links)
- On \(\bullet\)-line signed graphs \(L_\bullet(S)\) (Q2344008) (← links)
- Group connectivity and group colorings of graphs --- a survey (Q2430307) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- Functional graphs (Q2484549) (← links)
- Polynomially determining spanning connectivity of locally connected line graphs (Q2661222) (← links)