Pages that link to "Item:Q967361"
From MaRDI portal
The following pages link to Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361):
Displaying 19 items.
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- Total tightness implies Nash-solvability for three-person game forms (Q408181) (← links)
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440) (← links)
- Friendship two-graphs (Q604993) (← links)
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems (Q628313) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Reconstructing unrooted phylogenetic trees from symbolic ternary metrics (Q1670475) (← links)
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs (Q1720329) (← links)
- Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs (Q1800406) (← links)
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs (Q2132328) (← links)
- Three-way symbolic tree-maps and ultrametrics (Q2304088) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- (Q3741636) (← links)
- Gallai colorings and domination in multipartite digraphs (Q4650182) (← links)
- Connected colourings of complete graphs and hypergraphs (Q5964989) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
- Shared ancestry graphs and symbolic arboreal maps (Q6622737) (← links)
