Counting kernels in directed graphs with arbitrary orientations
type: Item
instance of: scholarly article
title: Counting kernels in directed graphs with arbitrary orientations
zbMATH Open document ID: 1541.05074
author: Bruno Jartoux
published in: Discrete Applied Mathematics
publication date: 2024-06-21T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 7869032
zbMATH Keywords: digraphs
zbMATH Keywords: digraph kernels
zbMATH Keywords: fuzzy circular interval graphs
zbMATH Keywords: cographs
zbMATH Keywords: claw-free graphs
MaRDI profile type: MaRDI publication profile
cites work: Polynomial algorithms for kernels in comparability, permutation and \(P_4\)-free graphs
cites work: Easy problems for tree-decomposable graphs
cites work: Stable matching with uncertain pairwise preferences
cites work: Digraphs
cites work: Convex-Round and Concave-Round Graphs
cites work: A combinatorial problem in logic
cites work: Perfect graphs, kernels, and cores of cooperative games
cites work: Nim, a game with a complete mathematical theory.
cites work: Q3416248
cites work: Claw-free graphs. VII. Quasi-line graphs
cites work: Q3077955
cites work: On kernels, defaults and even graphs
cites work: Kernels in directed graphs: A poison game
cites work: Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
cites work: Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
cites work: Combinatorial game theory foundations applied to digraph kernels
cites work: Q6147514
cites work: College Admissions and the Stability of Marriage
cites work: The list chromatic index of a bipartite multigraph
cites work: Counting and enumerating independent sets with applications to combinatorial optimization problems
cites work: Q3995616
cites work: Kernels in planar digraphs
cites work: Domination When the Stars Are Out
cites work: Classes of intersection digraphs with good algorithmic properties
cites work: Kernels in perfect line-graphs
cites work: Threshold graphs and related topics
cites work: On cliques in graphs
cites work: Q5844986
cites work: Counting the number of independent sets in chordal graphs
cites work: On the recognition of fuzzy circular interval graphs
cites work: Perfect graphs with polynomially computable kernels
cites work: Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property
cites work: Enumerating the kernels of a directed graph with no odd circuits
cites work: Matrix characterizations of circular-arc graphs
cites work: The complexity of computing the permanent
cites work: NP is as easy as detecting unique solutions
cites work: Finding kernels or solving SAT
cites work: Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels.
DOI: 10.1016/J.DAM.2024.04.018
description: scientific article; zbMATH DE number 7869032