| dbo:abstract |
En teoria de grafs un graf bipartit complet és aquell graf bipartit en el qual tots els vèrtexs de la partició estan connectats a tots els vèrtexs de la partició i viceversa. (ca) Úplný bipartitní graf (také úplný dvoudílný graf nebo úplný sudý graf) je pojem z matematiky, z teorie grafů. Rozumí se jím takový bipartitní graf, do kterého již nelze přidat žádnou hranu. Jeho vrcholy lze tedy rozdělit na dvě disjunktní množiny a každý vrchol z první množiny je spojen hranou s každým vrcholem z druhé množiny. Tyto grafy jsou až na isomorfismus určeny jednoznačně počtem vrcholů obou množin a značí se . Otázka rovinnosti úplného bipartitního grafu je jádrem úlohy o třech domech a třech studnách. (cs) En grafeteorio, plena dukolora grafeo aŭ dukliko estas speciala speco de dukolora grafeo ĉe kiu ĉiu vertico de la unua aro estas koneksa al ĉiu vertico de la dua aro. Tiel, plena dukolora grafeo G = (V1 + V2, E) estas dukolora grafeo tia ke por ĉiuj du verticoj kaj , estas eĝo v1v2 en E. Pro tio ke la grafeo estas dukolora, por ĉiuj du verticoj kaj , eĝo v1v2 ne estu en G; same por kaj . Plena dukolora grafeo kies dispartigoj havas vertic-nombrojn |V1 |
=m kaj |
| dbo:thumbnail |
wiki-commons:Special:FilePath/Biclique_K_3_5.svg?width=300 |
|
| dbo:wikiPageID |
525320 (xsd:integer) |
|
| dbo:wikiPageLength |
12069 (xsd:nonNegativeInteger) |
|
| dbo:wikiPageRevisionID |
1096393289 (xsd:integer) |
|
| dbo:wikiPageWikiLink |
dbr:Minor_(graph_theory) dbr:Perfect_matching dbr:Complete_graph dbr:Crown_graph dbr:Moore_graph dbr:NP-complete dbr:Leonhard_Euler dbr:Cage_(graph_theory) dbr:Star_(graph_theory) dbr:Claw-free_graph dbr:Clique_(graph_theory) dbr:Spanning_tree dbr:Tree_(graph_theory) dbr:Triangle-free_graph dbr:Laplacian_matrix dbr:Latin_square dbr:Adjacency_matrix dbr:Edge_coloring dbr:Formal_concept_analysis dbc:Parametric_families_of_graphs dbr:Outerplanar_graph dbr:Graph_drawing dbr:Graph_isomorphism dbr:Graph_theory dbr:Claw_(graph_theory) dbr:Athanasius_Kircher dbr:Biclique-free_graph dbr:Biclique_attack dbr:Bipartite_graph dbr:Edge_covering_number dbr:Modular_graph dbr:Regular_complex_polygon dbr:Planar_graph dbr:Maximum_matching dbr:Ramon_Llull dbr:Vertex_(graph_theory) dbr:Seven_Bridges_of_Königsberg dbr:Turán's_theorem dbr:Thomsen_graph dbr:Vertex_covering_number dbr:Heterogeneous_relation dbr:Turán_graph dbr:Wagner's_theorem dbr:Maximum_independent_set dbr:Mathematical dbr:Sufficient_condition dbr:Water,_gas,_and_electricity dbr:Mantel's_theorem dbr:Complete_multipartite_graph dbr:File:Complex_polygon_2-4-4.png dbr:File:Complex_polygon_2-4-4_bipartite_graph.png dbr:File:Complex_polygon_2-4-3-bipartite_graph.png dbr:File:Complex_polygon_2-4-3.png dbr:File:Biclique_K_3_5.svg dbr:File:Complex_polygon_2-4-5-bipartite_graph.png dbr:File:Complex_polygon_2-4-5.png dbr:File:Star_graphs.svg dbr:File:Zarankiewicz_K4_7.svg |
|
| dbp:chromaticNumber |
2 (xsd:integer) |
|
| dbp:imageCaption |
A complete bipartite graph with and (en) |
|
| dbp:name |
Complete bipartite graph (en) |
|
| dbp:wikiPageUsesTemplate |
dbt:Clear dbt:Infobox_graph dbt:Math dbt:Mvar dbt:Radic dbt:Reflist dbt:Short_description dbt:Sub dbt:Sup dbt:Abs |
|
| dct:subject |
dbc:Parametric_families_of_graphs |
|
| rdf:type |
yago:WikicatParametricFamiliesOfGraphs yago:Abstraction100002137 yago:Family108078020 yago:Group100031264 yago:Organization108008335 yago:WikicatGraphFamilies yago:YagoLegalActor yago:YagoLegalActorGeo yago:YagoPermanentlyLocatedEntity yago:SocialGroup107950920 yago:Unit108189659 |
|
| rdfs:comment |
En teoria de grafs un graf bipartit complet és aquell graf bipartit en el qual tots els vèrtexs de la partició estan connectats a tots els vèrtexs de la partició i viceversa. (ca) Úplný bipartitní graf (také úplný dvoudílný graf nebo úplný sudý graf) je pojem z matematiky, z teorie grafů. Rozumí se jím takový bipartitní graf, do kterého již nelze přidat žádnou hranu. Jeho vrcholy lze tedy rozdělit na dvě disjunktní množiny a každý vrchol z první množiny je spojen hranou s každým vrcholem z druhé množiny. Tyto grafy jsou až na isomorfismus určeny jednoznačně počtem vrcholů obou množin a značí se . Otázka rovinnosti úplného bipartitního grafu je jádrem úlohy o třech domech a třech studnách. (cs) En grafeteorio, plena dukolora grafeo aŭ dukliko estas speciala speco de dukolora grafeo ĉe kiu ĉiu vertico de la unua aro estas koneksa al ĉiu vertico de la dua aro. Tiel, plena dukolora grafeo G = (V1 + V2, E) estas dukolora grafeo tia ke por ĉiuj du verticoj kaj , estas eĝo v1v2 en E. Pro tio ke la grafeo estas dukolora, por ĉiuj du verticoj kaj , eĝo v1v2 ne estu en G; same por kaj . Plena dukolora grafeo kies dispartigoj havas vertic-nombrojn |V1 |
=m kaj |
| rdfs:label |
Complete bipartite graph (en) Graf bipartit complet (ca) Úplný bipartitní graf (cs) Vollständig bipartiter Graph (de) Plena dukolora grafeo (eo) Grafo bipartito completo (es) Graphe biparti complet (fr) Grafo bipartito completo (it) 완전 이분 그래프 (ko) 完全2部グラフ (ja) Полный двудольный граф (ru) Grafo bipartido completo (pt) Komplett bipartit graf (sv) 完全二分图 (zh) Повний двочастковий граф (uk) |
|
| owl:sameAs |
freebase:Complete bipartite graph yago-res:Complete bipartite graph wikidata:Complete bipartite graph dbpedia-ca:Complete bipartite graph dbpedia-cs:Complete bipartite graph dbpedia-de:Complete bipartite graph dbpedia-eo:Complete bipartite graph dbpedia-es:Complete bipartite graph dbpedia-fa:Complete bipartite graph dbpedia-fr:Complete bipartite graph dbpedia-hu:Complete bipartite graph dbpedia-it:Complete bipartite graph dbpedia-ja:Complete bipartite graph dbpedia-ko:Complete bipartite graph dbpedia-pt:Complete bipartite graph dbpedia-ru:Complete bipartite graph dbpedia-sv:Complete bipartite graph dbpedia-th:Complete bipartite graph dbpedia-uk:Complete bipartite graph dbpedia-vi:Complete bipartite graph dbpedia-zh:Complete bipartite graph https://global.dbpedia.org/id/53zcz |
|
| prov:wasDerivedFrom |
wikipedia-en:Complete_bipartite_graph?oldid=1096393289&ns=0 |
|
| foaf:depiction |
wiki-commons:Special:FilePath/Biclique_K_3_5.svg wiki-commons:Special:FilePath/Complex_polygon_2-4-3.png wiki-commons:Special:FilePath/Complex_polygon_2-4-4.png wiki-commons:Special:FilePath/Complex_polygon_2-4-4_bipartite_graph.png wiki-commons:Special:FilePath/Complex_polygon_2-4-5-bipartite_graph.png wiki-commons:Special:FilePath/Complex_polygon_2-4-5.png wiki-commons:Special:FilePath/Star_graphs.svg wiki-commons:Special:FilePath/Zarankiewicz_K4_7.svg wiki-commons:Special:FilePath/Complex_polygon_2-4-3-bipartite_graph.png |
|
| foaf:isPrimaryTopicOf |
wikipedia-en:Complete_bipartite_graph |
|
| is dbo:wikiPageRedirects of |
dbr:Biclique dbr:Complete_bigraph |
|
| is dbo:wikiPageWikiLink of |
dbr:Pál_Turán dbr:Queue_number dbr:Ronald_Graham dbr:Rook's_graph dbr:Ménage_problem dbr:Mac_Lane's_planarity_criterion dbr:Meshulam's_game dbr:Bipartite_double_cover dbr:Bipartite_half dbr:Book_embedding dbr:Dense_graph dbr:Dessin_d'enfant dbr:Apollonian_network dbr:Arboricity dbr:Jordan_curve_theorem dbr:List_of_graph_theory_topics dbr:Pathwidth dbr:Perfect_matching_in_high-degree_hypergraphs dbr:Petersen_family dbr:Unit_distance_graph dbr:Vera_T._Sós dbr:Vertex_cover dbr:Duopyramid dbr:Dyck_graph dbr:Incidence_coloring dbr:Kuratowski's_theorem dbr:List_of_incomplete_proofs dbr:List_of_quantum_processors dbr:Pseudoforest dbr:Robertson–Seymour_theorem dbr:Well-colored_graph dbr:Zero-divisor_graph dbr:1-planar_graph dbr:16-cell dbr:Complete_graph dbr:Computing_the_permanent dbr:Cross-polytope dbr:Crossing_number_(graph_theory) dbr:Crown_graph dbr:Generalized_polygon dbr:Petersen_graph dbr:Clique-width dbr:Glossary_of_graph_theory dbr:Graph_(discrete_mathematics) dbr:Graph_bandwidth dbr:Graph_coloring_game dbr:Graph_homomorphism dbr:Graph_minor dbr:Moore_graph dbr:Möbius_strip dbr:Container_method dbr:Convex_drawing dbr:Crossing_Numbers_of_Graphs dbr:Thickness_(graph_theory) dbr:Equitable_coloring dbr:Line_graph dbr:Linkless_embedding dbr:Logic_of_graphs dbr:Cage_(graph_theory) dbr:Chordal_bipartite_graph dbr:Biclique dbr:Star_(graph_theory) dbr:Claw-free_graph dbr:Clique_(graph_theory) dbr:Clique_complex dbr:Combinatorics dbr:Common_graph dbr:Half_graph dbr:Kotzig's_theorem dbr:Perfect_graph dbr:Magic_graph dbr:Spanning_tree dbr:Split_(graph_theory) dbr:Matching_polynomial dbr:McKay–Miller–Širáň_graph dbr:Peripheral_cycle dbr:Triangle-free_graph dbr:Well-covered_graph dbr:Distance-regular_graph dbr:Distance-transitive_graph dbr:Domatic_number dbr:Gallery_of_named_graphs dbr:Gammoid dbr:János_Komlós_(mathematician) dbr:Layered_graph_drawing dbr:List_coloring dbr:List_edge-coloring dbr:Shrikhande_graph dbr:Three_utilities_problem dbr:Trémaux_tree dbr:3-3_duoprism dbr:Cycle_graph dbr:Dual_graph dbr:Edge-transitive_graph dbr:Edge_coloring dbr:Erdős–Ko–Rado_theorem dbr:Eulerian_path dbr:Forbidden_graph_characterization dbr:Forcing_graph dbr:Outerplanar_graph dbr:Dinitz_conjecture dbr:Folded_cube_graph dbr:Graham–Pollak_theorem dbr:Graph_factorization dbr:Graph_isomorphism dbr:Graph_theory dbr:Graphic_matroid dbr:Graphon dbr:Kelmans–Seymour_conjecture dbr:Tree-depth dbr:2-satisfiability dbr:Tensor_product_of_graphs dbr:Hungarian_algorithm dbr:Jeannette_Janssen dbr:Power_graph_analysis dbr:Athanasius_Kircher dbr:Kazimierz_Zarankiewicz dbr:Biclique-free_graph dbr:Biclique_attack dbr:Bipartite_graph dbr:Bipartite_realization_problem dbr:Biregular_graph dbr:Birkhoff_polytope dbr:Blow-up_lemma dbr:Symmetric_graph dbr:Cograph dbr:Edge_cover dbr:Herschel_graph dbr:Homeomorphism_(graph_theory) dbr:HomoloGene dbr:Toroidal_graph dbr:Modular_graph dbr:Zarankiewicz_problem dbr:Dimension_(graph_theory) dbr:Distance-hereditary_graph dbr:Dominating_set dbr:BEST_theorem dbr:Planar_graph dbr:Polyhedral_combinatorics dbr:Circulant_graph dbr:Metric_dimension_(graph_theory) dbr:Ore's_theorem dbr:Rainbow_matching dbr:Ramanujan_graph dbr:Klaus_Wagner dbr:Unique_games_conjecture dbr:Shortness_exponent dbr:FKT_algorithm dbr:List_of_unsolved_problems_in_mathematics dbr:K_(disambiguation) dbr:Strong_perfect_graph_theorem dbr:Turán's_theorem dbr:Planarity_testing dbr:Rook_polynomial dbr:Even_circuit_theorem dbr:Fleischner's_theorem dbr:Sidorenko's_conjecture dbr:RAC_drawing dbr:Topological_graph_theory dbr:Pancyclic_graph dbr:Turán_graph dbr:Wagner's_theorem dbr:Turán's_brick_factory_problem dbr:Twin-width dbr:Table_of_simple_cubic_graphs dbr:Complete_bigraph |
|
| is foaf:primaryTopic of |
wikipedia-en:Complete_bipartite_graph |
|
