The following pages link to Transitiv orientierbare Graphen (Q5534028):
Displaying 50 items.
- Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$ (Q4990133) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- On an edge partition and root graphs of some classes of line graphs (Q5006610) (← links)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
- Gallai-Ramsey number of an 8-cycle (Q5012376) (← links)
- Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- (Q5042377) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- Testing superperfection of k-trees (Q5056149) (← links)
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- The simplicity index of tournaments (Q5061406) (← links)
- (Q5078313) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- (Q5087460) (← links)
- (Q5090996) (← links)
- Graphs defined on groups (Q5102166) (← links)
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs (Q5109420) (← links)
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
- EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS (Q5140108) (← links)
- A short note on undirected Fitch graphs (Q5198013) (← links)
- The Typical Structure of Gallai Colorings and Their Extremal Graphs (Q5204070) (← links)
- A conjecture on Gallai-Ramsey numbers of even cycles and paths (Q5206929) (← links)
- (Q5227528) (← links)
- ON GRAPHS WITH LIMITED NUMBER OF P<sub>4</sub>-PARTNERS (Q5248994) (← links)
- HOLES AND DOMINOES IN MEYNIEL GRAPHS (Q5248996) (← links)
- Metric Dimension of Bounded Tree-length Graphs (Q5268001) (← links)
- Easily Testable Graph Properties (Q5364250) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
- A Representation Theorem for Union-Difference Families and Application (Q5458554) (← links)
- (Q5708495) (← links)
- (Q5708507) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- To reorient is easier than to orient: An on-line algorithm for reorientation of graphs (Q5859844) (← links)
- Gallai-Ramsey numbers for graphs with five vertices of chromatic number four (Q5863481) (← links)
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product (Q5902101) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs (Q5919325) (← links)
- Domination graphs: Examples and counterexamples (Q5936465) (← links)
- Nesting of prime substructures in \(k-\)ary relations (Q5941284) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
- Connected colourings of complete graphs and hypergraphs (Q5964989) (← links)
- Linear-time recognition of double-threshold graphs (Q5970798) (← links)
