Категории

Ch 3.5.1 Kuratowski’s Theorem | Graph Theory Lectures by

Опубликовано: 22 Июнь 2026
на канале: Monalisa CS
407
10

In this Lecture i discussed
0:00 Intro & Revision
1:05 Kuratowski’s Theorem
2:30 EXAMPLE 7 Show that the graphs G1, G2, and G3 displayed in Figure are all homeomorphic.
4:45 THEOREM 2 A graph is nonplanar if and only if it contains a subgraph homeomorphic to K3,3 or K5
5:05 EXAMPLE 8 Determine whether the graph G shown in Figure is planar.
----------------------------------------------------
📗👩‍🏫Math Lecture for GATE CS    • Mathematics Lectures for GATE CSE by Monal...  
❓🙋‍♀️Math GATE PYQ :    • Mathematics GATE CS/DA PYQ (2010-2025) sol...  
----------------------------------------------
❓🙋‍♀️GATE General Aptitude (GA) solved by Monalisa    • General Aptitude PYQ solved by Monalisa Pr...  
----------------------------------------------------------------
📘👩‍🏫Algorithm Lectures :   • Algorithm Lectures for GATE CSE by Monalis...  
❓🙋‍♀️Algorithm GATE PYQ:    • Algorithm GATE CS & DA PYQ(2010-2025) solv...  
----------------------------------------------------------------
📙👩‍🏫Compiler Design Lectures :   • Compiler Design Lectures for GATE Computer...  
❓🙋‍♀️Compiler Design PYQ :   • Compiler Design PYQ(2010-2025) GATE CS sol...  
----------------------------------------------------------------------
📔👩‍🏫Theory Of Computation Lectures    • TOC (Theory of Computation) Lectures for G...  
❓🙋‍♀️TOC GATE PYQ:    • TOC GATE CS PYQ (2010-2025) solved by Mona...  
-------------------------------------------------------------------
📒👩‍🏫Data Structure Lecture:    • Data Structure (DS) Lecture for GATE Compu...  
❓🙋‍♀️Data Structure PYQ:    • Data Structure GATE CS PYQ(2010-2025) Solv...  
-----------------------------------------------------------------------
#gate_cs #gate #maths #mathmatics #discretemathematicsgate #discrete_mathematics #discretemathematics #gate2024 #monalisacs #graph #degree #connectivity #path #edge #vertex #euler #eulertheorem #hamilton

play_arrow
5,978
169

GETTIN’ SALTY EXPERIENCE PODCAST Ep.224 : CHICAGO FD | LT. BRETT SNOW

GETTIN’ SALTY EXPERIENCE PODCAST Ep.224 : CHICAGO FD | LT. BRETT SNOW
play_arrow
164
5

ARIZONA TOP 10 RICHEST CITIES UNVELED

ARIZONA TOP 10 RICHEST CITIES UNVELED
play_arrow
2,891
39

Открытие кейсов аномального бурана. Ивент/Stalcraft

Открытие кейсов аномального бурана. Ивент/Stalcraft
play_arrow
280,871
13 тыс

Now i can feel you mommy😑

Now i can feel you mommy😑

play_arrow
691
4

Are you winning son? (Ну что,сынок,выигрываешь?)

Are you winning son? (Ну что,сынок,выигрываешь?)
play_arrow
19,960
144

Хонаи фуруши дар нохияи панч ракамхо 89777524372

Хонаи фуруши дар нохияи панч ракамхо 89777524372
play_arrow
285,289
6.4 тыс

Valorant pro thrifties but they get increasingly more unexpected

Valorant pro thrifties but they get increasingly more unexpected
play_arrow
10,037
199

Speaker Johnson Warns: “The Communists Are Coming” | Brian Kilmeade Show

Speaker Johnson Warns: “The Communists Are Coming” | Brian Kilmeade Show
Похожие видео
play_arrow
Ch 3.6 Graph Coloring | Graph Theory Lectures by @MonalisaCS

Ch 3.6 Graph Coloring | Graph Theory Lectures by @MonalisaCS
play_arrow
Ch 3.5.1 Kuratowski’s Theorem | Graph Theory Lectures by @MonalisaCS

Ch 3.5.1 Kuratowski’s Theorem | Graph Theory Lectures by @MonalisaCS
play_arrow
Beautiful Niagara falls illuminations #shorts #illumination #niagarafalls #niagara #niagarafallsusa

Beautiful Niagara falls illuminations #shorts #illumination #niagarafalls #niagara #niagarafallsusa
play_arrow
GATE CS 2024 | Set 2 | Question: 49 The number of distinct minimum-weight spanning trees of the

GATE CS 2024 | Set 2 | Question: 49 The number of distinct minimum-weight spanning trees of the
play_arrow
GATE DA 2024| Question: 42 Let H, 𝐼, 𝐿, and 𝑁 represent height, number of internal nodes, number of

GATE DA 2024| Question: 42 Let H, 𝐼, 𝐿, and 𝑁 represent height, number of internal nodes, number of
play_arrow
GATE DA 2024 | Question: 22 The fundamental operations in a double-ended queue D are:insertFirst(e)

GATE DA 2024 | Question: 22 The fundamental operations in a double-ended queue D are:insertFirst(e)
play_arrow
GATE CS 2024 Set 2| GA Question: 7 A person sold two different items at the same price. He made 10%

GATE CS 2024 Set 2| GA Question: 7 A person sold two different items at the same price. He made 10%
play_arrow
GATE CS 2024 Set 1| GA Question: 9 A rectangular paper of 20 cm × 8 cm is folded 3 times. Each fold

GATE CS 2024 Set 1| GA Question: 9 A rectangular paper of 20 cm × 8 cm is folded 3 times. Each fold
play_arrow
GATE CS 2024 Set 1| GA Question: 3 Consider the following sample of numbers:9, 18, 11, 14, 15, 17,

GATE CS 2024 Set 1| GA Question: 3 Consider the following sample of numbers:9, 18, 11, 14, 15, 17,
play_arrow
GATE DA 2024 | GA Question: 1 If ‘→’ denotes increasing order of intensity, then the meaning of the

GATE DA 2024 | GA Question: 1 If ‘→’ denotes increasing order of intensity, then the meaning of the
play_arrow
Graph , Finite graph , Simple graph , Directed graph #graph #maths #monalisacs #gatecs

Graph , Finite graph , Simple graph , Directed graph #graph #maths #monalisacs #gatecs
play_arrow
All the best for GATE Exam #gate #gate_cs #gate2024 #gateexam #monalisacs

All the best for GATE Exam #gate #gate_cs #gate2024 #gateexam #monalisacs
play_arrow
GATE CS 2021 Set 1 | Question: 34Let G be a group of order 6, and H be a subgroup of G such that

GATE CS 2021 Set 1 | Question: 34Let G be a group of order 6, and H be a subgroup of G such that
play_arrow
Snow ❄️ storm #shorts #snow #snowstorm #snowfall

Snow ❄️ storm #shorts #snow #snowstorm #snowfall
play_arrow
Happy new year to all my students #happynewyear2024 #shorts #gate

Happy new year to all my students #happynewyear2024 #shorts #gate
play_arrow
Ch 2.11.4 : Greatest lower bound (glb), least upper bound (lub) | Poset | Set Theory Lectures

Ch 2.11.4 : Greatest lower bound (glb), least upper bound (lub) | Poset | Set Theory Lectures
play_arrow
Ch 2.11.1 : Partial Ordering ,Total order , Lexicographic Order | Set Theory Lectures

Ch 2.11.1 : Partial Ordering ,Total order , Lexicographic Order | Set Theory Lectures
play_arrow
GATE CS 2016 Set 1 | Q1:Let p,q,r,s represents the following propositions.p :x∈{8,9,10,11,12}q :x is

GATE CS 2016 Set 1 | Q1:Let p,q,r,s represents the following propositions.p :x∈{8,9,10,11,12}q :x is
play_arrow
GATE CS 2016 Set 2 | Q 1:Consider the following expressions:I.false II.Q III.true IV.P ∨Q V. ¬Q ∨P

GATE CS 2016 Set 2 | Q 1:Consider the following expressions:I.false II.Q III.true IV.P ∨Q V. ¬Q ∨P
play_arrow
Ch 1.5.3: Logic | Rules of Inference | Fallacies

Ch 1.5.3: Logic | Rules of Inference | Fallacies
play_arrow
GATE CS 2017 Set 1 | Q1: The statement (¬p)⇒(¬q) is logically equivalent to which of the statements

GATE CS 2017 Set 1 | Q1: The statement (¬p)⇒(¬q) is logically equivalent to which of the statements
play_arrow
GATE CS 2017 Set 1| Q2: Consider the first-order logic sentence F:∀x(∃yR(x,y)). Assuming non-empty

GATE CS 2017 Set 1| Q2: Consider the first-order logic sentence F:∀x(∃yR(x,y)). Assuming non-empty
play_arrow
Ch 1.5.2: Logic | Rules of Inference | Resolution

Ch 1.5.2: Logic | Rules of Inference | Resolution
play_arrow
Ch 1.5.1: Logic | Rules of Inference | Examples of arguments validity check

Ch 1.5.1: Logic | Rules of Inference | Examples of arguments validity check