Homomorphisms of infinite bipartite graphs onto complete bipartite graphs
Bohdan Zelinka (1983)
Czechoslovak Mathematical Journal
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard.”
Homomorphisms of infinite bipartite graphs onto complete bipartite graphs
Dense -free graphs are almost -partite.
Allen, Peter (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Upper and lower bounds for .
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A characterization of -closed graphs
Pavol Híc (1989)
Mathematica Slovaca
Similarity:
Induced complete -partite graphs in dense clique-less graphs.
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On partition graphs and generalizations of line graphs
Ladislav Nebeský (1977)
Časopis pro pěstování matematiky
Similarity: