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

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition

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

DOI10.7151/dmgt.1019zbMath0865.05046OpenAlexW2031953965MaRDI QIDQ2785646

Hortensia Galeana-Sánchez, Víctor Neumann-Lara

Publication date: 4 May 1997

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1019

zbMATH Keywords

digraphindependent setabsorbing setkernel-perfectcritical kernel-imperfectindependent kernel


Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)


Related Items

New extensions of kernel perfect digraphs to kernel imperfect critical digraphs, Perfect graphs, kernels, and cores of cooperative games



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2785646&oldid=15674434"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 17:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki