Pages that link to "Item:Q1078191"
From MaRDI portal
The following pages link to On the existence of two non-neighboring subgraphs in a graph (Q1078191):
Displaying 16 items.
- Characterization of graphs dominated by induced paths (Q868348) (← links)
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← links)
- Dominating cliques in \(P_ 5\)-free graphs (Q1176051) (← links)
- Chromatic-index-critical graphs of orders 11 and 12 (Q1277310) (← links)
- Dominating subgraphs in graphs with some forbidden structures (Q1343259) (← links)
- The use of elementary substructures in combinatorics (Q1344620) (← links)
- Maximum induced matchings in graphs (Q1363677) (← links)
- Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs (Q1684926) (← links)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs (Q2227834) (← links)
- Color-critical graphs with independent cutset (Q3804719) (← links)
- On a problem of El-Zahar and Erdős (Q6187349) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)
