The following pages link to Kernels in perfect line-graphs (Q908943):
Displaying 30 items.
- The binary matroids whose only odd circuits are triangles (Q272893) (← links)
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures (Q411838) (← links)
- Partial characterizations of coordinated graphs: Line graphs and complements of forests (Q1014303) (← links)
- Edge-choosability in line-perfect multigraphs (Q1301714) (← links)
- Edge-choosability of multicircuits (Q1301722) (← links)
- Neighbourhood-perfect line graphs (Q1343228) (← links)
- Fractional kernels in digraphs (Q1366601) (← links)
- On kernel-perfect orientations of line graphs (Q1584425) (← links)
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge (Q1690237) (← links)
- Gridline graphs: A review in two dimensions and an extension to higher dimensions (Q1861575) (← links)
- Kernels in graphs with a clique-cutset (Q1923523) (← links)
- Stable effectivity functions and perfect graphs (Q1974051) (← links)
- Stable matching with uncertain pairwise preferences (Q2078608) (← links)
- Bipartite choices (Q2105872) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Unconditional reflexive polytopes (Q2197693) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- The diameter of the stable marriage polytope: bounding from below (Q2305917) (← links)
- Absorbant of generalized de Bruijn digraphs (Q2380030) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
- The binary matroids with no odd circuits of size exceeding five (Q2664551) (← links)
- Preference swaps for the stable matching problem (Q2699977) (← links)
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph (Q4883064) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
- Toric rings of perfectly matchable subgraph polytopes (Q6081928) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- Unique stable matchings (Q6176757) (← links)
