Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A parity digraph has a kernel

From MaRDI portal
Publication:1080430
Jump to:navigation, search

DOI10.1007/BF02579405zbMath0599.05028OpenAlexW2028515467MaRDI QIDQ1080430

Mostafa Blidia

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579405

zbMATH Keywords

kerneldirected graphsparity digraph


Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)


Related Items

Recent problems and results about kernels in directed graphs, Combinatorial games on a graph, Parity graphs are kernel-M-solvable, Finding kernels or solving SAT, Perfect graphs, kernels, and cores of cooperative games, A new generalization of kernels in digraphs, On kernels in perfect graphs



Cites Work

  • Unnamed Item
  • A counterexample to a conjecture of Meyniel on kernel-perfect graphs
  • Solutions of irreflexive relations
  • Graphes Noyau-Parfaits
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1080430&oldid=13103743"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 01:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki