Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Competitive inheritance and limitedness of graphs - MaRDI portal

Competitive inheritance and limitedness of graphs

From MaRDI portal

Publication:4698085

Jump to:navigation, search

DOI10.1002/jgt.3190190308zbMath0822.05058OpenAlexW2013559633MaRDI QIDQ4698085

Publication date: 5 October 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190190308

zbMATH Keywords

cycle digraph inheritance chordal graphs triangle-free graphs series-parallel graphs line graphs competition graph competition number Opsut's conjecture arc graphs limitedness competitively inherited strongly inherited

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On Opsut's conjecture for hypercompetition numbers of hypergraphs ⋮ Phylogeny numbers

Cites Work

This page was built for publication: Competitive inheritance and limitedness of graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4698085&oldid=18929451"